(y) (a) sup y. inf y. (a) (a) inf x. sup x. (a)
|
|
- Suzan O’Brien’
- 6 years ago
- Views:
Transcription
1 Composition Algorithms for Crdinl Diretion Reltions Spiros Skidopoulos 1 nd Mnolis Kourkis 2 1 Dept. of Eletril nd Computer Engineering Ntionl Tehnil University of Athens Zogrphou Athens, Greee spiros@dl.ntu.gr, 2 Dept. of Eletroni nd Computer Engineering Tehnil University of Crete Chni Crete, Greee mnolis@ed.tu.gr, Astrt. We present forml model for qulittive sptil resoning with rdinl diretions tht is sed on reent proposl in the literture. We use our forml frmework to study the omposition opertion for the rdinl diretion reltions of this model. We onsider progressively more expressive lsses of rdinl diretion reltions nd give omposition lgorithms for these lsses. Finlly, when we onsider the prolem in its generlity, we show tht the inry reltion resulting from the omposition of some rdinl diretion reltions nnot even e expressed using the reltions whih re urrently employed y the relted proposl. 1 Introdution The omposition opertor hs reeived lot of ttention in the re of qulittive sptil resoning [7, 15, 5]. nd hs een studied for severl kinds of useful sptil reltions like topologil reltions [2, 3, 15], diretion reltions [6, 10] nd qulittive distne reltions [5, 4]. Typilly, the omposition opertor is used s mehnism for inferring new reltions from existing ones. Suh inferene mehnisms re very importnt s they re in the hert of ny system tht retrieves olletions of ojets similrly relted to eh other using sptil reltions [13]. Moreover, omposition is used to identify lsses of reltions tht hve trtle onsisteny prolem [7, 15, 12]. This work onentrtes on qulittive sptil resoning with rdinl diretion reltions [6, 10]. Crdinl diretion reltions desrie how regions of spe re pled reltive to one nother (e.g., region is north of region ). We study the reent model of Goyl nd Egenhofer [6]. This model is urrently one of the most expressive models for qulittive resoning with rdinl diretions. It works with extended regions nd hs potentil in Multimedi nd Geogrphi Informtion Systems pplitions [3, 4].
2 In this pper, we give forml definitions for the rdinl diretion reltions tht n e expressed in the model of Goyl nd Egenhofer [6]. Then, we use our forml frmework to study the omposition opertion for rdinl diretion reltions in the model of [6]. Goyl nd Egenhofer first studied this opertion in [6] ut their method does not lwys work orretly. The previous oservtion leves us with the tsk of finding orret method for omputing the omposition. To do this, we onsider progressively more expressive lsses of rdinl diretion reltions nd give omposition lgorithms for these lsses. Finlly, when we onsider the prolem in its generlity, we show tht the inry reltion resulting from the omposition of some rdinl diretion reltions nnot even e expressed using the reltions defined in [6]. A more detiled disussion s well s the proofs of the ove results pper in [16]. The rest of the pper is orgnized s follows. Setion 2 presents the forml model. In Setions 3 nd 4 we onsider two sulsses of rdinl diretion reltions nd give omposition lgorithms for these lsses. In Setion 5 we show tht the result of the omposition of some rdinl diretion reltions nnot e expressed using the reltions defined in [6]. Our onlusions re presented in Setion 6. 2 A Forml Model for Crdinl Diretion Informtion We onsider the Euliden spe < 2. Regions re defined s non-empty nd ounded sets of points in < 2. Let e region. The gretest lower ound or the infimum [11] of the projetion of region on the x-xis (respetively y- xis) is denoted y inf x () (respetively inf y ()). The lest upper ound or the supremum of the projetion of region on the x-xis (respetively y-xis) is denoted y sup x () (respetively sup y ()). We will often refer to sup nd inf s endpoints. (y) sup y () inf y () inf x () sup x () (x) Fig. 1. A region nd its ounding ox The minimum ounding ox of region, denoted y m(), is the ox formed y the stright lines x = inf x (), x = sup x (), y = inf y () nd y =
3 2 3 1 Fig. 2. Regions sup y () (see Figure 1). Oviously, the projetions on the x-xis (respetively y-xis) of region nd its minimum ounding ox hve the sme endpoints. We will onsider throughout the pper the following types of regions: Regions tht re homeomorphi to the unit disk [11]. The set of these regions will e denoted y REG. Regions in REG re losed, onneted nd hve onneted oundries (for definitions see [1, 11]) Regions tht re formed y finite unions of regions in REG. The set of these regions will e denoted y REG Λ. Notie tht regions in REG Λ n e disonneted nd n hve holes. In Figure 2, regions, 1, 2 nd 3 re in REG (lso in REG Λ ) nd region = 1 [ 2 [ 3 is in REG Λ. Regions in REG hve een previously studied in [6, 14]. They n e used to model res in vrious interesting pplitions, e.g., lnd prels in Geogrphi Informtion Systems [3, 4]. In the sequel we will formlly define rdinl diretion reltions for regions in REG. To this end, we will need regions in REG Λ. Let us now onsider two ritrry regions nd in REG. Let region e relted to region through rdinl diretion reltion (e.g., is north of ). Region will e lled the referene region (i.e., the region to whih the reltion is desried) while region will e lled the primry region (i.e., the region from whih the reltion is desried) [6]. The xes forming the minimum ounding ox of the referene region divide the spe into 9 tiles (Figure 3). The peripherl tiles orrespond to the eight rdinl diretion reltions south, southwest, west, northwest, north, northest, est nd southest. These tiles will e denoted y S(), SW(), W (), NW(), N(), NE(), E() nd SE() respetively. The entrl re orresponds to the region's minimum ounding ox nd is denoted y B(). By definition eh one of these tiles inludes the prts of the xes forming it. The union of ll 9 tiles is < 2. If primry region is inluded (in the set-theoreti sense) in tile S() of some referene region (Figure 3) then wesy tht is south of nd we write S. Similrly, we n define southwest (SW), west (W ), northwest (NW), north (N), northest (NE), est (E), southest (SE) nd ounding ox (B) reltions. If primry region lies prtly in the re NE() nd prtly in the re E() of some referene region (Figure 3) then we sy tht is prtly northest nd prtly est of nd we write NE:E.
4 NW() N() NE W() B() E() SW() SE() S() () () () (d) Fig. 3. Referene tiles nd reltions The generl definition of rdinl diretion reltion is s follows. Definition 1. An tomi rdinl diretion reltion is n element of the set fb, S, SW, W, NW, N, NE, E, SEg. A si rdinl diretion reltion is n tomi rdinl diretion reltion or n expression R 1 : :R k where 2» k» 9, R 1 ;:::;R k 2fB, S, SW, W, NW, N, NE, E, SEg, R i 6= R j for every i, j suh tht 1» i; j» k nd i 6= j, nd the tiles R 1 ();:::;R k () form region of REG for ny referene region. Exmple 1. The following re si rdinl diretion reltions: S; N E:E nd B:S:SW:W :N W:N:E:SE: Regions involved in these reltions re shown in Figures 3, 3 nd 3d respetively. In order to void onfusion we will write the tomi elements of rdinl diretion reltion ording to the following order: B, S, SW, W, NW, N, NE, E nd SE. Thus, we lwys write B:S:W insted of W :B:S or S:B:W. The reders should lso e wre tht for si reltion suh s B:S:W we will often refer to B, S nd W s its tiles. 2.1 Defining Bsi Crdinl Diretion Reltions Formlly Now we n formlly define the tomi rdinl diretion reltions B, S, SW, W, NW, N, NE, E nd SE of the model s follows: B iff inf x ()» inf x (), sup x ()» sup x (), inf y ()» inf y () nd sup y ()» sup y (). S iff sup y ()» inf y (), inf x ()» inf x () nd sup x ()» sup x (). SW iff sup x ()» inf x () nd sup y ()» inf y (). W iff sup x ()» inf x (), inf y ()» inf y () nd sup y ()» sup y (). NW iff sup x ()» inf x () nd sup y ()» inf y (). N iff sup y ()» inf y (), inf x ()» inf x () nd sup x ()» sup x (). NE iff sup x ()» inf x () nd sup y ()» inf y (). E iff sup x ()» inf x (), inf y ()» inf y () nd sup y ()» sup y (). SE iff sup x ()» inf x () nd sup y ()» inf y ().
5 () () Fig. 4. Reltions nd omponent vriles Using the ove tomi reltions we n define ll non-tomi ones. For instne reltion N E:E (Figure 4) nd reltion B:S:SW:W :N W:N:E:SE (Figure 4) re defined s follows: NE:E iff there exist regions 1 nd 2 in REG Λ suh tht = 1 [ 2, 1 NE nd 2 E. B:S:SW:W :NW:N:SE:E iff there exist regions 1 ;:::; 8 in REG Λ suh tht = 1 [ 2 [ 3 [ 4 [ 5 [ 6 [ 7 [ 8, 1 B, 2 S, 3 SW, 4 W, 5 NW, 6 N, 7 SE nd 8 E. In generl eh non-tomi rdinl diretion reltion is defined s follows. If 2» k» 9 then R 1 : :R k iff there exist regions 1 ;:::; k 2 REG Λ suh tht = 1 [ [ k ; 1 R 1 ; 2 R 2 ; :::; nd k R k. The vriles 1 ;:::; k in ny equivlene suh s the ove re in generl in REG Λ.For instne let us onsider Figure 4. The lines forming the ounding ox of the referene region divide region 2 REG into two omponents 1 nd 2. Clerly 2 is in REG Λ ut not in REG. Notie lso tht for every i, j suh tht 1» i; j» k nd i 6= j, i nd j hve disjoint interiors ut my shre points in their oundries. Eh of the ove rdinl diretion reltions n lso e defined using settheoreti nottion s inry reltions onsisting of ll pirs of regions stisfying the right-hnd sides of the iff" definitions. The reder should keep this in mind throughout the pper; this equivlentwy of defining rdinl diretion reltions will e very useful in Setion 5. The set of si rdinl diretion reltions in this model ontins 218 elements. We will use D to denote this set. Reltions in D re jointly exlusive nd pirwise disjoint. Elements of D n e used to represent definite informtion out rdinl diretions, e.g., N. An enumertion nd pitoril representtion for ll reltions in D n e found in [6]. Using the 218 reltions of D s our sis, we n define the powerset 2 D of D whih ontins reltions. Elements of 2 D re lled rdinl diretion
6 reltions nd n e used to represent not only definite ut lso indefinite informtion out rdinl diretions e.g., fn; Wg denotes tht region is north or west of region. [6] onsiders only smll suset of the disjuntive reltions of 2 D through nie pitoril representtion lled the diretion-reltion mtrix. In the following setions we will study the opertion of omposition for rdinl diretion reltions. Let us first define the omposition opertion for ritrry inry reltions [11]. Definition 2. Let R 1 nd R 2 e inry reltions. The omposition of reltions R 1 nd R 2, denoted y R 1 ffi R 2, is nother inry reltion whih stisfies the following. For ritrry regions nd, R 1 ffi R 2 holds if nd only if there exists region suh tht R 1 nd R 2 hold. A omposition tle stores the result of the omposition R 1 ffi R 2 for every pir of reltions R 1 nd R 2.For the se of rdinl diretion reltions, the omposition tle hs = entries. Therefore, sine it is rther pinful to mnully lulte eh entry, one hs to develop pproprite lgorithms to for the lultion of omposition. Goyl nd Egenhofer hve proposed method for omposing rdinl diretion reltions in [6]. Unfortuntely, the method presented in [6] does not lulte the orret omposition for severl ses (see [16] for detils). To remedy this our pproh ddresses the omposition prolem one step t time. In the next setion we will onsider the simplest se, i.e., the omposition of n tomi with si (tomi or non-tomi) rdinl diretion reltion. 3 Composing n Atomi with Bsi Crdinl Diretion Reltion In Figure 5 we show the omposition tle for tomi rdinl diretion reltions [6]. The tle uses the funtion symol ffi s shortut. For ritrry tomi rdinl diretion reltions R 1 ;:::;R k, the nottion ffi(r 1 ;:::;R k ) is shortut for the disjuntion of ll vlid si rdinl diretion reltions tht n e onstruted y omining tomi reltions R 1 ;:::;R k.for instne, ffi(sw;w;nw) stnds for the disjuntive reltion: Moreover, we define: fsw; W; NW; SW:W; W :NW; SW:W :NWg: ffi( ffi(r 11 ;:::;R 1k1 );ffi(r 21 ;:::;R 2k2 );:::;ffi(r m1 ;:::;R mkm ))= ffi(r 11 ;:::;R 1k1 ;R 21 ;:::;R 2k2 ;:::;R m1 ;:::;R mkm ): Applition of the opertor ffi s it hs een defined, suffies for our needs in this pper. As usul U dir stnds for the universl rdinl diretion reltion. The orretness of the trnsitivity tle n esily e verified using the definitions of Setion 2 nd the definition of omposition (Definition 2).
7 R 1 nr 2 N NE E SE N N NE ffi(ne;e) ffi(ne;e;se) NE ffi(n; NE) NE ffi(ne;e) ffi(ne;e;se) E ffi(n; NE) NE E SE SE ffi(n;ne;e;se;s;b) ffi(ne;e;se) ffi(e;se) SE S ffi(n; S;B) ffi(ne;e;se) ffi(e;se) SE SW ffi(s;sw;w;nw;n;b) U dir ffi(e;se;s;sw;w;b) ffi(se;s;sw) W ffi(nw;n) ffi(nw;n;ne) ffi(e;w;b) ffi(se;s;sw) NW ffi(nw;n) ffi(nw;n;ne) ffi(w;nw; N; NE;E;B) U dir B N NE E SE R 1 nr 2 S SW W NW B N ffi(s;n;b) ffi(sw;w;nw) ffi(w;nw) NW ffi(n; B) NE ffi(n; NE; E;SE;S;B) U dir ffi(w;nw;n;ne;e;b) ffi(nw;n;ne) ffi(b; N; NE; E) E ffi(se;s) ffi(se;s;sw) ffi(w;e;b) ffi(nw;n;ne) ffi(e;b) SE ffi(se;s) ffi(se;s;sw) ffi(e;se;s;sw;w;b) U dir ffi(b; S;E;SE) S S SW ffi(sw;w) ffi(sw;w;nw) ffi(s;b) SW ffi(s;sw) SW ffi(sw;w) ffi(sw;w;nw) ffi(b; S;SW;W) W ffi(s;sw) SW W NW ffi(w;b) NW ffi(s;sw;w;nw;n;b) ffi(sw;w;nw) ffi(w;nw) NW ffi(b; W;NW;N) B S SW W NW B Fig. 5. The omposition R 1 ffi R 2 of tomi reltions R 1 nd R 2 We now turn our ttention to the omposition of n tomi with si rdinl diretion reltion. We will first need few definitions nd lemms efore we present the min theorem (Theorem 1). Definition 3. A si rdinl diretion reltion R is lled retngulr iff there exist two retngles (with sides prllel to the x- nd y-xes) nd suh tht Ris stisfied; otherwise it is lled non-retngulr. Exmple 2. All tomi reltions re retngulr. Reltions B:N nd B:S:SW:W re retngulr while reltions B:S:SW nd B:S:N:SE re non-retngulr. The set of retngulr rdinl diretion reltions ontins the following 36 reltions: fb; S; SW; W; NW; N; NE; E; SE; S:SW; B:W; NW:N; N:NE; B:E; S:SE; SW:W; B:S; E:SE; W:NW; B:N; NE:E; S:SW:SE; NW:N:NE; B:W :E; B:S:N; SW:W :NW; NE:E:SE; B:S:SW:W; B:W :NW:N; B:S:E:SE; B:N:NE:E; B:S:SW:W :NW:N; B:S:N:NE:E:SE; B:S:SW:W :E:SE; B:W :NW:N:NE:E; B:S:SW:W :NW:N:NE:E:SEg: Definition 4. Let R 1 = R 11 : :R 1k nd R 2 = R 21 : :R 2l e two rdinl diretion reltions. R 1 inludes R 2 iff fr 21 ;:::;R 2l g fr 11 ;:::;R 1k g holds. Exmple 3. The si rdinl diretion reltion B:S:SW:W inludes reltion B:S:SW. Definition 5. Let R e si rdinl diretion reltion. The ounding reltion of R, denoted y Br(R) is the smllest retngulr reltion (with respet to the numer of tiles) tht inludes R.
8 Exmple 4. The ounding reltion of the si rdinl diretion reltion B:S:SW is reltion B:S:SW:W. Definition 6. Let R e retngulr rdinl diretion reltion. We will denote the retngulr reltion formed y the westernmost tiles of reltion R y Most(W; R). Similrly, we n define the retngulr reltions Most(S; R), Most(N;R) nd Most(E;R). Moreover, we will denote the tomi reltion formed y the southwesternmost tiles of reltion R y Most(SW;R). Similrly, we n define the tomi reltions Most(SE;R), Most(NW;R) nd Most(NE;R). Finlly, s speil se, we define Most(B;R) =R. Exmple 5. Let us onsider the retngulr reltion B:S:SW:W. Then ording to Definition 6 we hve: Most(W; B:S:SW:W )=SW:W; Most(SE; B:S:SW:W )=S; Most(S; B:S:SW:W )=S:SW; Most(SW; B:S:SW:W )=SW; Most(E;B:S:SW:W )=B:S; Most(NW;B:S:SW:W )=W; Most(N;B:S:SW:W )=B:W; Most(NE;B:S:SW:W )=B; Most(B;B:S:SW:W )=B:S:SW:W: The following lemm expresses n importnt property of opertor Most. Lemm 1. Let R 1 e n tomi nd R 2 eretngulr rdinl diretion reltion. Assume tht reltion Most(R 1 ;R 2 ) is Q 1 : :Q t. Then, the omposition of R 1 with Most(R 1 ;R 2 ) n e omputed using formul R 1 ffimost(r 1 ;R 2 )= ffi(r 1 ffi Q 1 ;:::;R 1 ffi Q t ). Now, fter ll the neessry definitions nd lemms, we n present our result. Theorem 1. Let R 1 e n tomi rdinl diretion reltion nd R 2 esi rdinl diretion reltion. Then R 1 ffi R 2 = R 1 ffimost(r 1 ; Br(R 2 )): The ove theorem give us method to ompute the omposition R 1 ffi R 2 of n tomi rdinl diretion reltion R 1 with si rdinl diretion reltion R 2. First we hve to lulte the reltion Most(R 1 ; Br(R 2 )). Then we use Lemm 1 nd the tle of Figure 5 to ompute R 1 ffi R 2. We illustrte the ove proedure in the following exmple. Exmple 6. Let R 1 = W e n tomi nd R 2 = B:S:SW e si rdinl diretion reltion. Then Most(W; Br(B:S:SW)) = SW:W. Thus using Theorem 1, we hve W ffi B:S:SW:W = W ffi SW:W. Using Lemm 1, we lso hve W ffi B:S:SW = ffi(w ffi SW;W ffi W ). Moreover, using the tle of Figure 5 we equivlently hve: W ffi B:S:SW = ffi(sw;w). Finlly, expnding opertor ffi we hve: W ffi B:S:SW = fsw; W; SW:Wg: The ove eqution n e esily verified (see lso Figure 6).
9 Fig. 6. Composing n tomi with si rdinl diretion reltion 4 Composing Retngulr with Bsi Crdinl Diretion Reltion In this setion we will study the omposition of retngulr with si rdinl diretion reltion. We will need the following definition. Definition 7. Let R 1 nd R 2 e two si rdinl diretion reltions. The tileunion of R 1 nd R 2, denoted y tile-union(r 1 ;R 2 ), is reltion formed from the union of tiles of R 1 nd R 2. For instne, if R 1 = B:S:SW nd R 2 = S:SW:W then tile-union(r 1 ;R 2 )= B:S:SW:W. Note tht the result of tile-union is not lwys vlid rdinl diretion reltion. For instne, if R 1 = W nd R 2 = E then tile-union(r 1 ;R 2 )= W :E =2D. Theorem 2. Let R 1 = R 11 : :R 1k eretngulr nd R 2 esi rdinl diretion reltion, where R 11 ;:::;R 1k re tomi rdinl diretion reltions. Then R 1 ffi R 2 = fq 2D: Q = tile-union(s 1 ;:::;s k )^ s 1 2 R 11 ffi R 2 ^ ^s k 2 R 1k ffi R 2 g: Using Theorem 2 we n esily derive Algorithm Compose-Ret-Bsi tht omputes the omposition R 3 of retngulr rdinl diretion reltion R 1 with si rdinl diretion reltion R 2. Assume tht R 1 is R 11 : :R 1k, where R 11 ;:::;R 1k re tomi rdinl diretion reltions. Algorithm Compose- Ret-Bsi proeed s follows. Initilly the lgorithm lultes reltions S i, 1» i» k s the omposition of the tomi reltion R 1i with the si rdinl diretion reltion R 2 (s in Setion 2). Susequently, Algorithm Compose-Ret- Bsi forms reltions y tking the tile-union of n tomi rdinl diretion reltion s i, from every rdinl diretion reltion S i (1» i» k). Finlly, the lgorithm heks whether the result of the union orresponds to vlid rdinl diretion reltion. If it does then this reltion is dded to the result R 3 ; otherwise it is disrded. We hve implemented Algorithm Compose-Ret-Bsi nd generted the ompositions R 1 ffi R 2 for every retngulr rdinl diretion reltion R 1 nd si rdinl diretion reltion R 2. The results nd the ode re ville from the uthors.
10 Fig. 7. Composing retngulr with si rdinl diretion reltion The following is n exmple of Algorithm Compose-Ret-Bsi in opertion. Exmple 7. Assume tht we wnt to lulte the omposition of the retngulr reltion W :NW with the si reltion B:S:SW (Figure 7). We hve: S 1 = W ffi B:S:SW = ffi(w ffi SW;W ffi SW)=ffi(W;SW)=fSW;W;SW:Wg S 2 = NW ffi B:S:SW = NW ffi W = fw;nw;w:nwg: Now we onstrut ll reltions formed y the union of one reltion from S 1 nd one reltion from S 2. These reltions re: SW:W; SW:NW, SW:W :NW, W, W :NW, W :NW, SW:W, SW:W :NW nd SW:W :NW. From the ove reltions only SW:W, SW:W :NW, W, W :NW re vlid rdinl diretion reltions. Therefore, we hve: W :NW ffi B:S:SW = fw; SW:W; W :NW; SW:W :NWg: The ove eqution n e esily verified (see lso Figure 7). 5 Composing Bsi Crdinl Diretion Reltions Let us now onsider the generl question of omposing two non-retngulr si rdinl diretion reltions. For this se we hve very interesting result: the lnguge of rdinl diretion onstrints (s defined in Setion 2) is not expressive enough to pture the inry reltion whih is the result of the omposition of non-retngulr si rdinl diretion reltions. This is illustrted y the following exmple. Exmple 8. Let us onsider region vriles ; ; nd rdinl diretion onstrints S:SW:W nd SW (see Figure 8). The only rdinl diretion onstrint implied y these two onstrints is SW. Thus, someone would e tempted to onlude tht (S:SW:W ffi SW) =SW. If this equlity ws orret then for eh pir of regions 0 ; 0 suh tht 0 SW 0, there exists region 0 suh tht 0 S:SW:W 0 nd 0 SW 0.However Figure 8 shows two suh regions 0 nd 0 suh tht 0 SW 0 nd it is impossile to find region 0 suh tht 0 S:SW:W 0.
11 0 0 () () Fig. 8. Illustrtion of Exmple 8 If we onsider this exmple refully, we will notie tht the given onstrint on nd implies the following onstrint on: the re overed y eh region sustituted for nnot e retngulr; it should extend so tht it overs tiles S();SW() nd W () for ny region. Oviously this onstrint is not expressile in the lnguge of rdinl diretion reltions presented in Setion 2. It is n open question to define n pproprite set of predites tht ould e used to ugment the onstrint lnguge of Setion 2 so tht the onstrints needed to define the result of omposition opertion re expressile in ll ses. It is importnt to point out tht the ove non-expressiility result should not deter sptil dtse prtitioners who would like to onsider dding the rdinl diretion reltions desried in this pper to their system. The disussion of the introdution (i.e., using the inferenes of omposition tle for sptil reltions in order to prune the serh spe during optimistion of ertin queries) still pplies ut now one hs to e reful to sy tht she is using onstrint propgtion mehnism nd not omposition tle! Unfortuntely, we nnot e s positive out using the rdinl diretion reltions defined in this pper in the onstrint dtses frmeworks of [8] or [9]. In these frmeworks, the lss of onstrints involved must e losed under the opertion of vrile elimintion. Exmple 8 ove demonstrtes tht this is not true for the lss of rdinl diretion onstrints exmined in this pper. For exmple, if we hve onstrints S:SW:W ; SW nd we eliminte vrile, the result of the elimintion is not expressile in the onstrint lnguge we strted with! So the lnguge of Setion 2 needs to e modified in order to e used in onstrint dtse model. We re urrently working on extending this lnguge to remove this limittion. 6 Conlusions In this pper we gve forml presenttion of the rdinl diretion model of Goyl nd Egenhofer [6]. We used our forml frmework to study the omposition opertion for rdinl diretion reltions in this model. We onsidered
12 progressively more expressive lsses of rdinl diretion reltions nd gve omposition lgorithms for these lsses. Finlly, we hve demonstrted tht in some ses, the inry reltion resulting from the omposition of two rdinl diretion reltions nnot even e expressed using the voulry defined in [6]. Referenes 1. W.G. Chinn nd N.E. Steenrod. First Conepts of Topology. The Mthemtil Assoition of Ameri, Z. Cui, A.G. Cohn, nd D.A. Rndell. Qulittive nd Topologil Reltionships in Sptil Dtses. In Proeedings of SSD-93, pges , M.J. Egenhofer. Resoning out Binry Topologil Reltionships. In Proeedings of SSD-91, pges , A.U. Frnk. Qulittive Sptil Resoning out Distnes nd Diretions in Geogrphi Spe. Journl of Visul Lnguges nd Computing, 3: , C. Freks. Using Orienttion Informtion for Qulittive Sptil Resoning. In Proeedings of COSIT-92, volume 639 of LNCS, pges , R. Goyl nd M.J. Egenhofer. Crdinl Diretions Between Extended Sptil Ojets. IEEE Trnstions on Dt nd Knowledge Engineering, (in press), Aville t 7. M. Grigni, D. Ppdis, nd C. Ppdimitriou. Topologil Inferene. In Proeedings of IJCAI-95, P.C. Knellkis, G.M. Kuper, nd P.Z. Revesz. Constrint Query Lnguges. Journl of Computer nd System Sienes, 51:26 52, M. Kourkis. The Complexity of Query Evlution in Indefinite Temporl Constrint Dtses. Theoretil Computer Siene, 171:25 60, Jnury Speil Issue on Unertinty in Dtses nd Dedutive Systems, Editor: L.V.S. Lkshmnn. 10. G. Ligozt. Resoning out Crdinl Diretions. Journl of Visul Lnguges nd Computing, 9:23 44, S. Lipshutz. Set Theory nd Relted Topis. MGrw Hill, B. Neel nd H.-J. Bürkert. Resoning out Temporl Reltions: A Mximl Trtle Sulss of Allen's Intervl Alger. Journl of the ACM, 42(1):43 66, Jnury D. Ppdis, N. Arkoumnis, nd N. Krpilidis. On The Retrievl of Similr Configurtions. In Proeedings of 8th Interntionl Symposium on Sptil Dt Hndling (SDH), C.H. Ppdimitriou, D. Suiu, nd V. Vinu. Topologil Queries in Sptil Dtses. Journl of Computer nd System Sienes, 58(1):29 53, J. Renz nd B. Neel. On the Complexity of Qulittive Sptil Resoning: A Mximl Trtle Frgment of the Region Connetion Clulus. Artifiil Intelligene, 1-2:95 149, S. Skidopoulos nd M. Kourkis. Composing Crdinl Diretions Reltions. In C. Jensen nd B. Seeger, editors, Proeedings of the 7th Interntionl Symposium on Sptil nd Temporl Dtses (SSTD-01), volume 2121 of LNCS, pges , July 2001.
A family of directional relation models for extended objects
1 A fmily of diretionl reltion models for extended ojets Spiros Skidopoulos, Nikos Srks, Timos Sellis, Mnolis Kourkis Astrt In this pper, we introdue fmily of expressive models for qulittive sptil resoning
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationComposing cardinal direction relations
Artificial Intelligence 152 (2004) 143 171 www.elsevier.com/locate/artint Composing cardinal direction relations Spiros Skiadopoulos a,, Manolis Koubarakis b a Knowledge and Database Systems Laboratory,
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationFigure 1. The left-handed and right-handed trefoils
The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationOn Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS
ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More informationMath 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)
Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This rticle ppered in journl pulished y Elsevier. The ttched copy is furnished to the uthor for internl non-commercil reserch nd eduction use, including for instruction t the uthors institution nd shring
More informationExercise 3 Logic Control
Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationGreen s Theorem. (2x e y ) da. (2x e y ) dx dy. x 2 xe y. (1 e y ) dy. y=1. = y e y. y=0. = 2 e
Green s Theorem. Let be the boundry of the unit squre, y, oriented ounterlokwise, nd let F be the vetor field F, y e y +, 2 y. Find F d r. Solution. Let s write P, y e y + nd Q, y 2 y, so tht F P, Q. Let
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationFor a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then
Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:
More informationUniversity of Sioux Falls. MAT204/205 Calculus I/II
University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationDiscrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α
Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationWhen does a Composition Table Provide a Complete and Tractable. Proof Procedure for a Relational Constraint Language?
When does Composition Tle Provide Complete nd Trtle Proof Proedure for Reltionl Constrint Lnguge? Brndon Bennett, Amr Isli nd Anthony Cohn Division of Artiil Intelligene Shool of Computer Studies University
More informationfor all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx
Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationElectromagnetic-Power-based Modal Classification, Modal Expansion, and Modal Decomposition for Perfect Electric Conductors
LIAN: EM-BASED MODAL CLASSIFICATION EXANSION AND DECOMOSITION FOR EC 1 Eletromgneti-ower-bsed Modl Clssifition Modl Expnsion nd Modl Deomposition for erfet Eletri Condutors Renzun Lin Abstrt Trditionlly
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationLearning Objectives of Module 2 (Algebra and Calculus) Notes:
67 Lerning Ojetives of Module (Alger nd Clulus) Notes:. Lerning units re grouped under three res ( Foundtion Knowledge, Alger nd Clulus ) nd Further Lerning Unit.. Relted lerning ojetives re grouped under
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationExercise sheet 6: Solutions
Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd
More informationarxiv: v1 [math.ca] 21 Aug 2018
rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationPropositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.
Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationA Study on the Properties of Rational Triangles
Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationProving the Pythagorean Theorem
Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or
More information18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106
8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly
More informationPure 2D Context-free Puzzle P system with Conditional Communication
IOSR Journl of Mthemtis (IOSR-JM) e-issn: 78-578 p-issn: 39-765X. Volume 0 Issue 6 Ver. III (Nov - De. 04) PP 06- www.iosrjournls.org Pure D Context-free Puzzle P system with Conditionl Communition S.Hemlth
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informations the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p
Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose
More informationArrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationLesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.
27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
More informationLinear choosability of graphs
Liner hoosility of grphs Louis Esperet, Mikel Montssier, André Rspud To ite this version: Louis Esperet, Mikel Montssier, André Rspud. Liner hoosility of grphs. Stefn Felsner. 2005 Europen Conferene on
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationThe Word Problem in Quandles
The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationLecture Summaries for Multivariable Integral Calculus M52B
These leture summries my lso be viewed online by liking the L ion t the top right of ny leture sreen. Leture Summries for Multivrible Integrl Clulus M52B Chpter nd setion numbers refer to the 6th edition.
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationTest Generation from Timed Input Output Automata
Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted
More informationOutline. Theory-based Bayesian framework for property induction Causal structure induction
Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning The origins of usl knowledge Question: how do people relily ome
More informationT b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.
Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene
More information4.4 Areas, Integrals and Antiderivatives
. res, integrls nd ntiderivtives 333. Ares, Integrls nd Antiderivtives This section explores properties of functions defined s res nd exmines some connections mong res, integrls nd ntiderivtives. In order
More informationComputing with finite semigroups: part I
Computing with finite semigroups: prt I J. D. Mitchell School of Mthemtics nd Sttistics, University of St Andrews Novemer 20th, 2015 J. D. Mitchell (St Andrews) Novemer 20th, 2015 1 / 34 Wht is this tlk
More information2.4 Linear Inequalities and Interval Notation
.4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or
More informationPYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:
PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationModel Reduction of Finite State Machines by Contraction
Model Reduction of Finite Stte Mchines y Contrction Alessndro Giu Dip. di Ingegneri Elettric ed Elettronic, Università di Cgliri, Pizz d Armi, 09123 Cgliri, Itly Phone: +39-070-675-5892 Fx: +39-070-675-5900
More informationThe study of dual integral equations with generalized Legendre functions
J. Mth. Anl. Appl. 34 (5) 75 733 www.elsevier.om/lote/jm The study of dul integrl equtions with generlized Legendre funtions B.M. Singh, J. Rokne,R.S.Dhliwl Deprtment of Mthemtis, The University of Clgry,
More informationPolynomials. Polynomials. Curriculum Ready ACMNA:
Polynomils Polynomils Curriulum Redy ACMNA: 66 www.mthletis.om Polynomils POLYNOMIALS A polynomil is mthemtil expression with one vrile whose powers re neither negtive nor frtions. The power in eh expression
More informationArrow s Impossibility Theorem
Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties
More informationReference : Croft & Davison, Chapter 12, Blocks 1,2. A matrix ti is a rectangular array or block of numbers usually enclosed in brackets.
I MATRIX ALGEBRA INTRODUCTION TO MATRICES Referene : Croft & Dvison, Chpter, Blos, A mtri ti is retngulr rr or lo of numers usull enlosed in rets. A m n mtri hs m rows nd n olumns. Mtri Alger Pge If the
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationINTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable
INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationA Non-parametric Approach in Testing Higher Order Interactions
A Non-prmetri Approh in Testing igher Order Intertions G. Bkeerthn Deprtment of Mthemtis, Fulty of Siene Estern University, Chenkldy, Sri Lnk nd S. Smit Deprtment of Crop Siene, Fulty of Agriulture University
More informationDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Desriptionl Complexity of Non-Unry Self-Verifying Symmetri Differene Automt Lurette Mris 1,2 nd Lynette vn Zijl 1 1 Deprtment of Computer Siene, Stellenosh University, South Afri 2 Merk Institute, CSIR,
More information