Perfect Bayesian Equilibrium in Extensive- Form Games Ù

Size: px
Start display at page:

Download "Perfect Bayesian Equilibrium in Extensive- Form Games Ù"

Transcription

1 Pefect Bayesian Equiibium in Extensive-Fom Games Page Pefect Bayesian Equiibium in Extensive- Fom Games Ù Intoduction Bayes Requiement Bayes Requiement Bayes Requiement 5 Bayes Requiement 4 6 A Refinement 7 Intoduction We have seen that Nash equiibia of extensive-fom games can be undesiabe because they can ey on incedibe theats at off-the-equiibium-path subgames. We wee sometimes abe to efine away such undesiabe equiibia by stengthening ou soution concept demanding subgame pefection, which equies that the estiction of a stategy pofie to any subgame be a Nash equiibium of that subgame. Subgame pefection wi not eiminate a undesiabe equiibia of extensive-fom games, howeve. Conside the extensive-fom game of Figue. Anaysis of its stategic fom quicky shows that this game has two pue-stategy Nash equiibia: (U,) and (A,). This game has ony one subgame, viz. the entie game, so both of these Nash equiibia ae aso subgame pefect. U D A [p] [_p] A U D,,,,,, Figue : Subgame pefection admits undesiabe equiibia. The (A,) equiibium is objectionabe fo the foowing eason. [Note that paye s infomation set is off-the-equiibium path with espect to the (A,) equiibium i.e. it is neve eached when the payes confom to the equiibium specification.] If paye s infomation set wee eve eached, paye woud be uncetain about whethe it was eached via paye having chosen U o via paye having Ù Û 99 by Jim Ratiff, <jim@vituapefection.com>, <

2 Pefect Bayesian Equiibium in Extensive-Fom Games Page chosen D. Howeve, it doesn t matte to paye s decision which move paye had chosen. No matte what paye s beiefs about paye s non-a choice, paye sticty pefes to choose at his infomation set when it is eached. (If paye had chosen U, paye eceives fom and ony fom. If paye had chosen D, paye eceives fom and ony fom.) Because is not a best esponse at paye s infomation set fo any possibe beiefs which paye might have thee, we say that is dominated at paye s infomation set. We can descibe ou dissatisfaction with the (A,) equiibium by objecting to its specification of an action at an infomation set which is dominated at that infomation set. Let s fomaize this easoning. We begin by equiing that at evey one of he infomation sets each paye has some beiefs about the node at which she is ocated conditiona on having eached that infomation set. Fo a paticua stategy pofie ß, we equie that, fo each paye i I, Bayes Requiement and at each of he infomation sets h i H i, paye i has beiefs i ªh i º ÙǪh i º about the node at which she is ocated conditiona upon being infomed that pay has eached the infomation set h i. The beiefs i ªh i º Ǫh i º ae just a pobabiity distibution ove the nodes in the infomation set. Paye i s beiefs in this game, then, ae a specification, fo each paye-i infomation set h i H i, of such conditiona beiefs at that infomation set. The n-tupe =(,, n ) of paye beiefs is a beief pofie. In ode to popey citique aeged equiibia we equie that a candidate equiibium be not just a stategy pofie ß but be a stategy-beief pofie (ß, ). We want to state an equiibium equiement that woud oosey say something ike: Fo evey paye i I and evey paye-i infomation set h i H i, paye i s stategy is a best esponse given he beiefs i ªh i º Ǫh i º at the infomation set h i. Howeve, this is too vague at east to me! so we must be moe pecise in ou statement. Reca that a subgame is fomed by identifying a singeton infomation set and incuding a its successos fom the oigina game. Infomation sets, actions, and payoffs fo the subgame wee deived fom the oigina game by estiction. We now geneaize the concept of a subgame and define a continuation game. A continuation game is an infomation set h i H i fo some paye ifiôªh i º and a of its successo nodes fom the oigina game. Again, infomation sets, actions, and payoffs in the continuation game ae deived fom the oigina game by estiction. If the designated initia infomation set is not a singeton, then this continuation is not a subgame. And with good eason: This continuation game cannot be payed as a game in its own ight, because thee is no initia node. So we incude in the specification of the continuation game the pobabiity distibution i ªh i º ove the nodes of the initia infomation set h i given in the beief pofie. (Think of this continuation game as being peceded by a move of Natue s, whee Natue chooses between the nodes of h i accoding to the pobabiity distibution i ªh i º.) We can estict any stategy ß j and any paye beiefs j to this continuation game We e assuming pefect eca.

3 Pefect Bayesian Equiibium in Extensive-Fom Games Page just as we esticted a stategy to a subgame: simpy thow out its specifications at infomation sets which don t beong to the smae game. Conside the continuation game defined by some paye-i infomation Bayes Requiement set h i H i and the conditiona beiefs i ªh i º. The estiction of the stategy-beief pofie (ß, ) to this continuation game must be a Nash equiibium of the continuation game. Definition Let (ß, ) be a stategy-beief pofie and et h i H i be an infomation set fo paye i=ôªh i º. Let (ß, ) be the estiction of (ß, ) to the continuation game which begins at the infomation set h i. We say that the paye-i stategy ß i is sticty dominated beginning at the infomation set h i if thee exists anothe paye-i stategy ß i such that, fo a othe deeted stategy pofies ß i fo the opponents, paye i s expected payoff in the continuation game is sticty highe fo (ß i,ß i ) than fo ß. Bayes Requiements and ae sufficient to emove the undesiabe equiibium, viz. (A,), in Figue. To see this we constuct the continuation game beginning at paye s infomation set fo some beiefs paameteized by p [,]. See Figue. The stategic fom of this continuation game is aso shown in Figue, fom which it is cea that is the unique Nash equiibium in the continuation game. Figue : The continuation game beginning at paye s infomation set. Moe geneay, Bayes Requiement ejects a stategy pofies which specify at any infomation set an action which is dominated at that infomation set. Exampe: Resticting a stategy-beief pofie to a continuation game Conside the stategy-beief pofie s=(u,a,d;;p) fo some p [,] in the extensive-fom game in Figue a. Now conside the continuation game beginning at paye s infomation set. Figue b depicts the estiction s of this stategy-beief pofie to the continuation game. The expected payoff vecto to the estiction s is p(,)+(_p)(,4)=(_p,4_p). Let s evauate whethe the stategy pofie s passes Bayes Requiement with espect to the continuation game beginning at paye s infomation set. We can constuct a stategic fom fo the continuation game. Fo exampe, the expected payoff vecto to the esticted stategy pofie (a,c;) is p(,)+(_p)(,)=(p,p+). The expected payoff vecto to (*,*;) is p(,)+(_p)(,6) =

4 Pefect Bayesian Equiibium in Extensive-Fom Games Page 4 (,6_4p). Simia cacuations fo paye s othe stategies yied the payoff matix in Figue. In ode that s passes Bayesian Requiement with espect to the specified continuation game, s=(a,d;;p) must be a Bayesian Nash equiibium of the continuation game. This equies that (a,d) be a best esponse by paye to, i.e. _p maxù{p,,_p}, which is satisfied fo a p [,]. In ode that be a best esponse by paye to (a,d) we must have 4_p 6_4p, which is satisfied if and ony if p [,]. Theefoe s is a Bayesian Nash equiibium of this continuation game if and ony if p [,]. Figue : The estiction of the (U,a,d;;p) of (a) to the continuation game (b). Figue : The stategic-fom matix coesponding to the continuation game of Figue b. We can aso ask whethe is sticty dominated beginning at paye s infomation set. This woud equie that o p<. 6_4p>maxÙ{+p,4_p,,4_p}=4_p,

5 Pefect Bayesian Equiibium in Extensive-Fom Games Page 5 Figue 4: Requiements and don t even guaantee Nash equiibium. Bayes Requiements and ae not stong enough howeve to geneay captue even the concept of Nash equiibium. Conside the game in Figue 4. The stategy-beief pofie (U,;p=) satisfies Bayes Requiements and, yet (U,) is not even a Nash equiibium of the game. So we add a thid equiement. It ensues that in equiibium each paye s beiefs ae coect. The beiefs at any on-the-path infomation set must be detemined fom Bayes Requiement the stategy pofie accoding to Bayes Rue. I.e. if h i H i is a paye-i infomation set eached with positive pobabiity when the payes confom to ß, then i ªh i º Ǫh i º must be computed fom ß using Bayes Rue. This equiement eiminates the non Nash-equiibium pofie (U,; p=) fom the game of Figue 4 because, given that paye is choosing U, paye s beief at his infomation set must put a weight on the node eached by U i.e. we must have p= athe than p=. Howeve, the addition of Bayes Requiement does not guaantee that suviving stategy-beief pofies ae even subgame-pefect equiibia of the game. Conside the game of Figue 5. Conside the subgame beginning with paye s singeton infomation set. This subgame has a unique Nash equiibium of (U,). Theefoe the unique subgame-pefect equiibium of the entie game is (B,U,). Evey infomation set is on the path, and Bayes Rue impies p=. This stategy-beief pofie (B,U,;p=) satisfies Bayes Requiements,, and.

6 Pefect Bayesian Equiibium in Extensive-Fom Games Page 6 A B U D [p] [_p] Figue 5: Requiements,, and do not guaantee subgame pefection. But now conside the stategy-beief pofie (A,U,;p=). This is a Nash equiibium and satisfies Bayes Requiements,, and. (Note that paye s infomation is off-the-path, and theefoe Requiement puts no estiction on p.) Yet this pofie is not subgame pefect, because we have aeady seen that subgame pefection equies (U,) by payes and. The pobem with this pofie can be taced to the beiefs at paye s infomation set. The ony way that paye s infomation set coud be eached is if paye chose B. In this case, accoding the stategy pofie, paye woud choose U. Theefoe paye, conditiona on eaching he infomation set, shoud infe that she is ocated at he eft-hand node and theefoe shoud beieve that p= athe than p=. We now add an additiona equiement, which eiminates the non subgame-pefect equiibium just consideed. Bayes Requiement 4 The beiefs at any off-the-path infomation set must be detemined fom the stategy pofie accoding to Bayes Rue wheneve possibe. Bayes Requiements,,, and 4 taken togethe constitute the definition of pefect Bayesian equiibium in extensive-fom games. (Fo the sende-eceive games we studied eaie, Bayes Requiement 4 has no efining powe. Theefoe Bayes Requiements,, and constitute the definition of pefect Bayesian equiibium in sende-eceive games.) As we saw with sende-eceive games, pefect Bayesian equiibium can admit equiibia which ae objectionabe because they ey on off-the-path beiefs which ae in some sense suspect. Conside the game in Figue 6. Thee ae two casses of pue-stategy pefect Bayesian equiibia: (U,;p=) and {(A,;p):p [, ]}.

7 Pefect Bayesian Equiibium in Extensive-Fom Games Page 7 Figue 6: Pefect Bayesian equiibium can be usefuy efined. In cass of these equiibia, paye s infomation set is off-the-path. Paye s beiefs at this infomation set ae that, given that this infomation set was eached, thee is a positive pobabiity that the infomation set was eached via paye choosing D. But note fom the stategic fom that D is dominated fo paye by A. On the othe hand, U is not dominated. If paye obseves that, contay to his expectation, paye did not choose A, what shoud paye beieve about paye s actua choice? Did paye choose U o D? Paye coud neve pofit by paying D instead of the dominating stategy A. Howeve, paye coud conside paying U in hopes that paye woud pay, giving paye a payoff of instead of. Theefoe we shoud attach zeo weight to the event that a deviation by paye was D athe than U. Theefoe we shoud equie, when paye s infomation set is off-the-path, that p=. If possibe, each paye s beiefs off the equiibium path shoud put A Refinement zeo weight on nodes which can ony be eached if anothe paye pays a stategy that is sticty dominated beginning at some infomation set.

Extensive games with imperfect information

Extensive games with imperfect information Extensive games with impefect infomation ECON500 Advanced micoeconomics ectues in game theoy Fall 0, Pat 3 7.07.0 G.. Asheim, ECON500-3 Incomplete Complete infomation infomation Pefect infomation Impefect

More information

The Internet Ecosystem and Evolution

The Internet Ecosystem and Evolution The Intenet Ecosystem and Evolution Contents Netwok outing: basics distibuted/centalized, static/dynamic, linkstate/path-vecto inta-domain/inte-domain outing Mapping the sevice model to AS-AS paths valley-fee

More information

The University of British Columbia

The University of British Columbia The Univesity of Bitish Coubia Copute Science 304 Midte Exaination Febuay 5, 2007 Tie: 50 inutes Tota aks: 38 Instucto: Rache Pottinge Nae ANSWER KEY (PRINT) (Last) (Fist) Signatue This exaination has

More information

Examples 4.2 and 4.3

Examples 4.2 and 4.3 Exampe 4.2 Exampes 4.2 an 4.3 Consie a 6-Hz synchonous machine with the foowing pu paametes:.7 k.49.64.96.65.742.65.3.526.54 k k.55 H 2.37 s.5 Obseve that this is a oun oto machine because =, ~, an >.

More information

Configuring RSVP-ATM QoS Interworking

Configuring RSVP-ATM QoS Interworking Configuing RSVP-ATM QoS Intewoking Last Updated: Januay 15, 2013 This chapte descibes the tasks fo configuing the RSVP-ATM QoS Intewoking featue, which povides suppot fo Contolled Load Sevice using RSVP

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

Reachable State Spaces of Distributed Deadlock Avoidance Protocols

Reachable State Spaces of Distributed Deadlock Avoidance Protocols Reachable State Spaces of Distibuted Deadlock Avoidance Potocols CÉSAR SÁNCHEZ and HENNY B. SIPMA Stanfod Univesity We pesent a family of efficient distibuted deadlock avoidance algoithms with applications

More information

CS 5114: Theory of Algorithms. Sorting. Insertion Sort. Exchange Sorting. Clifford A. Shaffer. Spring 2010

CS 5114: Theory of Algorithms. Sorting. Insertion Sort. Exchange Sorting. Clifford A. Shaffer. Spring 2010 Depatment of Compute Science Viginia Tech Backsbug, Viginia Copyight c 10 by Ciffod A. Shaffe 3 4 5 7 : Theoy of Agoithms Tite page : Theoy of Agoithms Ciffod A. Shaffe Sping 10 Ciffod A. Shaffe Depatment

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces

A Family of Distributed Deadlock Avoidance Protocols and their Reachable State Spaces A Family of Distibuted Deadlock Avoidance Potocols and thei Reachable State Spaces Césa Sánchez, Henny B. Sipma, and Zoha Manna Compute Science Depatment Stanfod Univesity, Stanfod, CA 94305-9025 {cesa,sipma,manna}@cs.stanfod.edu

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Massachusetts Institute of Technology Department of Mechanical Engineering

Massachusetts Institute of Technology Department of Mechanical Engineering cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed

More information

Modeling a shared medium access node with QoS distinction

Modeling a shared medium access node with QoS distinction Modeling a shaed medium access node with QoS distinction Matthias Gies, Jonas Geutet Compute Engineeing and Netwoks Laboatoy (TIK) Swiss Fedeal Institute of Technology Züich CH-8092 Züich, Switzeland email:

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Communication vs Distributed Computation: an alternative trade-off curve

Communication vs Distributed Computation: an alternative trade-off curve Communication vs Distibuted Computation: an altenative tade-off cuve Yahya H. Ezzeldin, Mohammed amoose, Chistina Fagouli Univesity of Califonia, Los Angeles, CA 90095, USA, Email: {yahya.ezzeldin, mkamoose,

More information

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially

More information

ART GALLERIES WITH INTERIOR WALLS. March 1998

ART GALLERIES WITH INTERIOR WALLS. March 1998 ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall

More information

User Specified non-bonded potentials in gromacs

User Specified non-bonded potentials in gromacs Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of

More information

Assessment of Track Sequence Optimization based on Recorded Field Operations

Assessment of Track Sequence Optimization based on Recorded Field Operations Assessment of Tack Sequence Optimization based on Recoded Field Opeations Matin A. F. Jensen 1,2,*, Claus G. Søensen 1, Dionysis Bochtis 1 1 Aahus Univesity, Faculty of Science and Technology, Depatment

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Prof. Feng Liu. Fall /17/2016

Prof. Feng Liu. Fall /17/2016 Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2

More information

IP Multicast Simulation in OPNET

IP Multicast Simulation in OPNET IP Multicast Simulation in OPNET Xin Wang, Chien-Ming Yu, Henning Schulzinne Paul A. Stipe Columbia Univesity Reutes Depatment of Compute Science 88 Pakway Dive South New Yok, New Yok Hauppuage, New Yok

More information

Language Identification for Texts Written in Transliteration

Language Identification for Texts Written in Transliteration Language Identification for Texts Written in Transiteration Andrey Chepovskiy, Sergey Gusev, Margarita Kurbatova Higher Schoo of Economics, Data Anaysis and Artificia Inteigence Department, Pokrovskiy

More information

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

More information

Practice Board. Side 8 I 9 O 7 U # 3 ) ] ( [ = } / { & 5

Practice Board. Side 8 I 9 O 7 U # 3 ) ] ( [ = } / { & 5 ! 1 $4 3 "2 M ;, +? :. actice oad Å Æ Ø ide ith easabe akes, fi out the epty keys. se the pactice sheet found in oad 2. actice fo 1 inutes a day and in ess than 3 days you wi be typing coecty without having

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

Color Correction Using 3D Multiview Geometry

Color Correction Using 3D Multiview Geometry Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,

More information

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform A Shape-peseving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonunifom Fuzzification Tansfom Felipe Fenández, Julio Gutiéez, Juan Calos Cespo and Gacián Tiviño Dep. Tecnología Fotónica, Facultad

More information

IMAGE-GUIDED NON-LOCAL DENSE MATCHING WITH THREE-STEPS OPTIMIZATION

IMAGE-GUIDED NON-LOCAL DENSE MATCHING WITH THREE-STEPS OPTIMIZATION IMAGE-GUIDED NON-LOCAL DENSE MATCHING WITH THREE-STEPS OPTIMIZATION Xu Huang a, Yongjun Zhang a, *, Zhaoxi Yue a a Schoo of Remote Sensing and Infomation Engineeing, Wuhan Univesity, Wuhan, Hubei, China

More information

understood as processors that match AST patterns of the source language and translate them into patterns in the target language.

understood as processors that match AST patterns of the source language and translate them into patterns in the target language. A Basic Compier At a fundamenta eve compiers can be understood as processors that match AST patterns of the source anguage and transate them into patterns in the target anguage. Here we wi ook at a basic

More information

Tufts University Math 13 Department of Mathematics November 14, :00 noon to 1:20 pm

Tufts University Math 13 Department of Mathematics November 14, :00 noon to 1:20 pm Tufts Univesit Math 3 Depatment of Mathematics Novembe, Eam : noon to : pm Instuctions: No calculatos, notes o books ae allowed. Unless othewise stated, ou must show all wok to eceive full cedit. Simplif

More information

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012 2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

Outerjoins, Constraints, Triggers

Outerjoins, Constraints, Triggers Outerjoins, Constraints, Triggers Lecture #13 Autumn, 2001 Fa, 2001, LRX #13 Outerjoins, Constraints, Triggers HUST,Wuhan,China 358 Outerjoin R S = R S with danging tupes padded with nus and incuded in

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

On Cooperative Local Repair in Distributed Storage

On Cooperative Local Repair in Distributed Storage On Coopeative Loca Repai in Distibuted Stoae Anit Sinh Rawat Depatment of ECE The Univesity of Texas at Austin Austin, TX 7871 Emai: anits@utexas.edu. Aya Mazumda Depatment of ECE Univesity of Minnesota

More information

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.

A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann. A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of

More information

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson

DEADLOCK AVOIDANCE IN BATCH PROCESSES. M. Tittus K. Åkesson DEADLOCK AVOIDANCE IN BATCH PROCESSES M. Tittus K. Åkesson Univesity College Boås, Sweden, e-mail: Michael.Tittus@hb.se Chalmes Univesity of Technology, Gothenbug, Sweden, e-mail: ka@s2.chalmes.se Abstact:

More information

Distributed Dynamic Capacity Contracting: An overlay congestion pricing framework for differentiated-services architecture

Distributed Dynamic Capacity Contracting: An overlay congestion pricing framework for differentiated-services architecture Distibuted Dynamic apacity ontacting: An oveay congestion picing famewok fo diffeentiated-sevices achitectue Muat Yukse Shivkuma Kayanaaman Anuj Goe Rensseae Poytechnic Institute oy NY yuksem@cspiedu shivkuma@ecsepiedu

More information

Layer Partition-based Matching Algorithm of DDM

Layer Partition-based Matching Algorithm of DDM Laye Patition-based Matching Agoithm of DDM Nwe Nwe Myint Thein, and Nay Min Tun Abstact High Leve Achitectue (HLA) is achitectue fo euse and inteopeation of simuations. In HLA paadigm, the Runtime Infastuctue

More information

Control of Mobile Robots

Control of Mobile Robots Conto of Mobie obots efeences: -. Siegwat and I.. Noubakhsh, Intoduction to Autonomous Mobie obots, MIT, 004 (Chaps.,3. - S. G. Tzafestas, Intoduction to Mobie obot Conto, Esevie, 013. 1 Tpes of Mobie

More information

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples Multi-azimuth Pestack Time Migation fo Geneal Anisotopic, Weakly Heteogeneous Media - Field Data Examples S. Beaumont* (EOST/PGS) & W. Söllne (PGS) SUMMARY Multi-azimuth data acquisition has shown benefits

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Detection and Recognition of Alert Traffic Signs

Detection and Recognition of Alert Traffic Signs Detection and Recognition of Alet Taffic Signs Chia-Hsiung Chen, Macus Chen, and Tianshi Gao 1 Stanfod Univesity Stanfod, CA 9305 {echchen, macuscc, tianshig}@stanfod.edu Abstact Taffic signs povide dives

More information

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile

More information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

More Relation Model: Functional Dependencies

More Relation Model: Functional Dependencies More Reation Mode: Functiona Dependencies Lecture #7 Autumn, 2001 Fa, 2001, LRX #07 More Reation Mode: Functiona Dependencies HUST,Wuhan,China 152 Functiona Dependencies X -> A = assertion about a reation

More information

On Adaptive Bandwidth Sharing with Rate Guarantees

On Adaptive Bandwidth Sharing with Rate Guarantees On Adaptive Bandwidth Shaing with Rate Guaantees N.G. Duffield y T. V. Lakshman D. Stiliadis y AT&T Laboatoies Bell Labs Rm A175, 180 Pak Avenue Lucent Technologies Floham Pak, 101 Cawfods Cone Road NJ

More information

On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units

On Memory Optimal Code Generation for Exposed Datapath Architectures with Buffered Processing Units On Memoy Optima Code Geneation fo Exposed Datapath Achitectues with Buffeed Pocessing Units Makus Andes, Anoop Bhagyanath and Kaus Schneide Depatment of Compute Science Univesity of Kaisesauten, Gemany

More information

An Optimizing Compiler

An Optimizing Compiler An Optimizing Compier The big difference between interpreters and compiers is that compiers have the abiity to think about how to transate a source program into target code in the most effective way. Usuay

More information

Fifth Wheel Modelling and Testing

Fifth Wheel Modelling and Testing Fifth heel Modelling and Testing en Masoy Mechanical Engineeing Depatment Floida Atlantic Univesity Boca aton, FL 4 Lois Malaptias IFMA Institut Fancais De Mechanique Advancee ampus De lemont Feand Les

More information

Optimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints

Optimal Sporadic Location Privacy Preserving Systems in Presence of Bandwidth Constraints Optimal Spoadic Location Pivacy Peseving Systems in Pesence of Bandwidth Constaints ABSTRACT Michael Hemann KU Leuven ESAT/COSIC, iminds Leuven, Belgium michael.hemann@esat.kuleuven.be Claudia Diaz KU

More information

ME 210 Applied Mathematics for Mechanical Engineers

ME 210 Applied Mathematics for Mechanical Engineers Note that the unit vectos, T, N and B ae thee unit vectos pependicula to each othe whose diections ae dictated by the local behavio of the cuve C at its point P. They fom a moving ight handed vecto fame

More information

Elliptic Generation Systems

Elliptic Generation Systems 4 Elliptic Geneation Systems Stefan P. Spekeijse 4.1 Intoduction 4.1 Intoduction 4.2 Two-Dimensional Gid Geneation Hamonic Maps, Gid Contol Maps, and Poisson Systems Discetization and Solution Method Constuction

More information

On Error Estimation in Runge-Kutta Methods

On Error Estimation in Runge-Kutta Methods Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

HISTOGRAMS are an important statistic reflecting the

HISTOGRAMS are an important statistic reflecting the JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe

More information

Dual Licensing in Open Source Software Markets

Dual Licensing in Open Source Software Markets Dual Licensing in Open Souce Softwae Makets Stefano Comino Fabio M. Manenti Novembe 2008 Abstact In this pape we pesent a theoetical model to study the chaacteistics and the commecial sustainability of

More information

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n Complete Solution to Potential and E-Field of a sphee of adius R and a chage density ρ[] = CC 2 and n Deive the electic field and electic potential both inside and outside of a sphee of adius R with a

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

The University of North Carolina. its production and consumption. Embedded signal processing applications are naturally

The University of North Carolina. its production and consumption. Embedded signal processing applications are naturally Feasibility concens in PGM gaphs with bounded bues Sanjoy Bauah Depatment of Compute Science The Univesity of Vemont Email: sanjoy@cs.uvm.edu Steve Goddad Kevin Jeay Depatment of Compute Science The Univesity

More information

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen

Accurate Diffraction Efficiency Control for Multiplexed Volume Holographic Gratings. Xuliang Han, Gicherl Kim, and Ray T. Chen Accuate Diffaction Efficiency Contol fo Multiplexed Volume Hologaphic Gatings Xuliang Han, Gichel Kim, and Ray T. Chen Micoelectonic Reseach Cente Depatment of Electical and Compute Engineeing Univesity

More information

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes

On the Conversion between Binary Code and Binary-Reflected Gray Code on Boolean Cubes On the Convesion between Binay Code and BinayReflected Gay Code on Boolean Cubes The Havad community has made this aticle openly available. Please shae how this access benefits you. You stoy mattes Citation

More information

On using circuit-switched networks for file transfers

On using circuit-switched networks for file transfers On using cicuit-switched netwoks fo file tansfes Xiuduan Fang, Malathi Veeaaghavan Univesity of Viginia Email: {xf4c, mv5g}@viginia.edu Abstact High-speed optical cicuit-switched netwoks ae being deployed

More information

Decision Support for Rule and Technique Discovery in an Uncertain Environment

Decision Support for Rule and Technique Discovery in an Uncertain Environment Decision Suppot fo Rule and Technique Discovey in an Uncetain Envionment D. James F. Smith III Naval Reseach Laboatoy, Code 5741 Washington, D.C., 0375-5000 Telephone: 0.767.5358 Fax: 0.404.7690 jfsmith@dsews.nl.navy.mil

More information

Voting-Based Grouping and Interpretation of Visual Motion

Voting-Based Grouping and Interpretation of Visual Motion Voting-Based Gouping and Intepetation of Visual Motion Micea Nicolescu Depatment of Compute Science Univesity of Nevada, Reno Reno, NV 89557 micea@cs.un.edu Géad Medioni Integated Media Systems Cente Univesity

More information

Elastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD

Elastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD The 3d Intenational Confeence on Design Engineeing and Science, ICDES 1 Pilsen, Czech Repulic, August 31 Septeme 3, 1 Elastohydodynamic Luication Analysis of Jounal Beaings Using CAD Toshihio OZASA *1,

More information

Monte Carlo Techniques for Rendering

Monte Carlo Techniques for Rendering Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety

More information

Getting Started PMW-EX1/PMW-EX3. 1 Rotate the grip with the RELEASE button pressed. Overview. Connecting the Computer and PMW-EX1/EX3

Getting Started PMW-EX1/PMW-EX3. 1 Rotate the grip with the RELEASE button pressed. Overview. Connecting the Computer and PMW-EX1/EX3 A PMW-EX1/PMW-EX3 Getting Stated Oveview This document descibes how to use the XDCAM EX Vesion Up Tool (heeafte Vesion Up Tool ) to upgade the PMW-EX1 and PMW-EX3 to vesion 1.20 (PMW-EX1) o vesion 1.10

More information

Automatically Testing Interacting Software Components

Automatically Testing Interacting Software Components Automatically Testing Inteacting Softwae Components Leonad Gallaghe Infomation Technology Laboatoy National Institute of Standads and Technology Gaithesbug, MD 20899, USA lgallaghe@nist.gov Jeff Offutt

More information

Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)

Also available at  ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment

More information

Segmentation Based Recovery of Arbitrarily Warped Document Images

Segmentation Based Recovery of Arbitrarily Warped Document Images Segmentation Based Recovey of Abitaiy Waped Document Images B. Gatos, I. Patikakis and K. Ntiogiannis Computationa Inteigence Laboatoy, Institute of Infomatics and Teecommunications, Nationa Cente fo Scientific

More information

AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY

AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY Chistophe Waceman (1), William G. Pichel (2), Pablo Clement-Colón (2) (1) Geneal Dynamics Advanced Infomation Systems, P.O. Box 134008 Ann Abo

More information

Extract Object Boundaries in Noisy Images using Level Set. Final Report

Extract Object Boundaries in Noisy Images using Level Set. Final Report Extact Object Boundaies in Noisy Images using Level Set by: Quming Zhou Final Repot Submitted to Pofesso Bian Evans EE381K Multidimensional Digital Signal Pocessing May 10, 003 Abstact Finding object contous

More information

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal

More information

3D Reconstruction from 360 x 360 Mosaics 1

3D Reconstruction from 360 x 360 Mosaics 1 CENTER FOR MACHINE PERCEPTION 3D Reconstuction fom 36 x 36 Mosaics CZECH TECHNICAL UNIVERSITY {bakstein, pajdla}@cmp.felk.cvut.cz REPRINT Hynek Bakstein and Tomáš Pajdla, 3D Reconstuction fom 36 x 36 Mosaics,

More information

A Novel Image-Based Rendering System With A Longitudinally Aligned Camera Array

A Novel Image-Based Rendering System With A Longitudinally Aligned Camera Array EUOGAPHICS 2 / A. de Sousa, J.C. Toes Shot Pesentations A Novel Image-Based endeing System With A Longitudinally Aligned Camea Aay Jiang Li, Kun Zhou, Yong Wang and Heung-Yeung Shum Micosoft eseach, China

More information

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

A Two-stage and Parameter-free Binarization Method for Degraded Document Images A Two-stage and Paamete-fee Binaization Method fo Degaded Document Images Yung-Hsiang Chiu 1, Kuo-Liang Chung 1, Yong-Huai Huang 2, Wei-Ning Yang 3, Chi-Huang Liao 4 1 Depatment of Compute Science and

More information

Introduction to Engineering Seismology Lecture 18

Introduction to Engineering Seismology Lecture 18 Lectue 18: Intoduction to GIS, Integation of hazad paametes on GIS platfom; Final zonation map pepaation with case study of Bangaloe Topics Geogaphical Infomation System (GIS) Analytic Hieachy Pocess (AHP)

More information

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.

(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number. Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show

More information

A Caching Algorithm using Evolutionary Game Theory in a File-Sharing System

A Caching Algorithm using Evolutionary Game Theory in a File-Sharing System A Caching Algoithm using Evolutionay Game Theoy in a File-Shaing System Masahio Sasabe Cybemedia Cente Osaka Univesity 1-32 Machikaneyama-cho, Toyonaka-shi Osaka 56-43, Japan m-sasabe@cmc.osaka-u.ac.jp

More information

The EigenRumor Algorithm for Ranking Blogs

The EigenRumor Algorithm for Ranking Blogs he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy

More information

Development and Analysis of a Real-Time Human Motion Tracking System

Development and Analysis of a Real-Time Human Motion Tracking System Development and Analysis of a Real-Time Human Motion Tacking System Jason P. Luck 1,2 Chistian Debunne 1 William Hoff 1 Qiang He 1 Daniel E. Small 2 1 Coloado School of Mines 2 Sandia National Labs Engineeing

More information

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks

Lifetime and Energy Hole Evolution Analysis in Data-Gathering Wireless Sensor Networks 788 IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, VOL. 12, NO. 2, APRIL 2016 Lifetime and Enegy Hole Evolution Analysis in Data-Gatheing Wieless Senso Netwoks Ju Ren, Student Membe, IEEE, Yaoxue Zhang,

More information

A Petrel Plugin for Surface Modeling

A Petrel Plugin for Surface Modeling A Petre Pugin for Surface Modeing R. M. Hassanpour, S. H. Derakhshan and C. V. Deutsch Structure and thickness uncertainty are important components of any uncertainty study. The exact ocations of the geoogica

More information

BOLT BERANEK AND NEWMAN INTERFACE MESSAGE PROCESSOR PROGRAM. Update Edition of November t9?3. February /73

BOLT BERANEK AND NEWMAN INTERFACE MESSAGE PROCESSOR PROGRAM. Update Edition of November t9?3. February /73 BOT BERANEK AND NEWMAN NC. ' THE NTERFACE MESSAGE PROCESSOR PROGRAM Febuay 973 Update Edition of Novembe t9?3 /73 \ BOT BERANEK AND NEWMAN NC. THE NTERFACE MESSAGE PROCESSOR PROGRAM Febuay 973 Update Edition

More information

Efficient protection of many-to-one. communications

Efficient protection of many-to-one. communications Efficient potection of many-to-one communications Miklós Molná, Alexande Guitton, Benad Cousin, and Raymond Maie Iisa, Campus de Beaulieu, 35 042 Rennes Cedex, Fance Abstact. The dependability of a netwok

More information

Cryptanalysis of Hwang-Chang s a Time-Stamp Protocol for Digital Watermarking

Cryptanalysis of Hwang-Chang s a Time-Stamp Protocol for Digital Watermarking Cyptanalysis of Hwang-Chang s a Time-Stamp Potocol fo Digital Watemaking *Jue-Sam Chou, Yalin Chen 2, Chung-Ju Chan 3 Depatment of Infomation Management, Nanhua Univesity Chiayi 622 Taiwan, R.O.C *: coesponding

More information

Administrative Scope and Role Hierarchy Operations

Administrative Scope and Role Hierarchy Operations Administative Scope and Role Hieachy Opeations Jason Campton and Geoge Loizou School of Compute Science and Infomation Systems Bikbeck College, Univesity of London ABSTRACT The ARBAC97 model makes an impotant

More information

Adaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization

Adaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization ICCAS25 June 2-5, KINTEX, Gyeonggi-Do, Koea Adaptation of Motion Captue Data of Human Ams to a Humanoid Robot Using Optimization ChangHwan Kim and Doik Kim Intelligent Robotics Reseach Cente, Koea Institute

More information

Effective Data Co-Reduction for Multimedia Similarity Search

Effective Data Co-Reduction for Multimedia Similarity Search Effective Data Co-Reduction fo Multimedia Similaity Seach Zi Huang Heng Tao Shen Jiajun Liu Xiaofang Zhou School of Infomation Technology and Electical Engineeing The Univesity of Queensland, QLD 472,

More information

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1

Improvement of First-order Takagi-Sugeno Models Using Local Uniform B-splines 1 Impovement of Fist-ode Takagi-Sugeno Models Using Local Unifom B-splines Felipe Fenández, Julio Gutiéez, Gacián Tiviño and Juan Calos Cespo Dep. Tecnología Fotónica, Facultad de Infomática Univesidad Politécnica

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information