6.1 Topological relations between two simple geometric objects

Size: px
Start display at page:

Download "6.1 Topological relations between two simple geometric objects"

Transcription

1 Chapter 5 proposed a spatial odel to represent the spatial extent of objects in urban areas. The purpose of the odel, as was clarified in Chapter 3, is ultifunctional, i.e. it has to be capable of supplying inforation for spatial analysis and real-tie visualisation. This chapter is devoted to the potential of the odel to respond to spatial queries. Most of the spatial queries in the urban areas require nowledge about the relationships between two arbitrary spatial objects, e.g. "retrieve all the shops which are 500 fro the station", "show all the buildings higher than 5 floors in the neighbourhood", etc. Topological relations, being invariant over scaling, shift and rotation, have been widely approved by the GIS counity as the ost appropriate anner to describe spatial relationships. Therefore, this chapter estiates the ability of the spatial odel to identify topological relations. The derivation of topological relations here is based on the fraewor provided by the 9- intersection odel (see Egenhofer and Herring 990). The coprehensive foral categorisation of spatial relations is copleted upon the coparison of the nine intersections between topological priitives, i.e. interior, boundary and exterior of object. The relations that can be detected applying the fraewor are any ore than the ones that exist in reality. Therefore, the identification of possible relations becoes an iportant issue. Several authors have copleted studies on the possible topological relations; however, ost of the refer to the 2D doain and only partially to the 3D doain. The spatial odel proposed focuses on the 3D doain. Therefore the first part of this chapter elaborates on the derivation on feasible relations between siple objects and proposes a unified procedure for identification of relationships. discussion on the copleteness of the set of relations obtained, topologically equivalent configurations and the naing of the relations is presented. The second part of the chapter illustrates the anner of detecting any of the relations by the SSM. The nuber of operations needed to detect any of relationships is discussed. The intention is to evaluate of the "cost" of arc reoval for spatial analysis. final deliberation draws conclusions on the suitability of SSM to identify spatial relations. 6. Topological relations between two siple geoetric objects Suppose two siple spatial objects and (see Chapter 5) defined as non-epty sets in the sae topological space Λ, then their boundary, interior, exterior and closure will be denoted by,,,,,, and (see Chapter 2). The binary relation R(,) between the two objects is then identified by coposing all the possible set intersections of the six topological priitives, i.e.,,,,,,, and, 09

2 and detecting epty( ) or non-epty ( )intersections. For exaple, if two objects have a coon boundary, the intersection between the boundaries is non-epty, i.e. = ; if they have intersecting interiors, then the intersection is not epty, i.e. =. The relation R(,) is a subset of the Cartesian product of, i.e. R (, ). The intersection between the six priitives can be represented as an ordered set given by a 3 3 intersection atrix, i.e. R (, ) = = Since each set intersection can have either the epty or non-epty value, different "patterns" of the 9-intersection atrix define different relations. For exaple, the relation defined above is disjoint. For siplicity, instead of the atrix representation, a line representation of all the intersections will be used in the following text. Furtherore, the set intersections equal to the epty set will be denoted by 0 and the non-epty intersections by. Thus, each relation (being a sequence of 0 and ) corresponds to a binary nuber, which can be transfored to a decial nuber (see Kufoniyi 995). For exaple, the relation between objects with nonintersecting closures (referring to the atrix representation above) can be represented as 0000, which is the decial nuber 3. It will be denoted as a decial code R03. It is apparent that different ordering of the intersections between topological priitives will result in a different decial code. In this text, we will use the order shown in Table 6-. The benefit of this anner is that the nine intersections can be separated into two general groups, which will be denoted as closure intersections and exterior intersections. The closure intersections represent the 4-intersection odel built on the utual intersections of two topological priitives (interior and boundary), i.e.,, and. The closure intersections are positioned to the left side of the intersection between objects' exteriors, i.e.. The exterior intersections are the four intersections between the exteriors and closure, i.e.,, and. They are placed on the right of the intersection between both exteriors. Since the set intersection is constantly nonepty for the defined spatial odel (see Chapter 5), it "acts" as a deliiter between closure and exterior intersection. The advantage of the linear ordering and corresponding decial coding is threefold: facilitates the coparison between 4- and 9-intersection odels increases the readability of relations, i.e. the code can be used instead of a nae facilitates the analysis of relations, i.e. groups of relations with specific properties can be identified. Table 6-: Decial coding of the relations R The theoretical nuber of all the relations that can be derived fro the atrix is 2 9, i.e. 52 relations. However, only a sall nuber of the can be realised in reality. For exaple, 0

3 the only possible configurations between two bodies in 3D or two siple surfaces in 2D are only eight (see Figure 6-6 and Figure 6-5). The identification of possible relations is as iportant as the identification of the relations. Fro the ipleentation point of view, the eliination of ipossible relations will reduce the nuber of cobinations to be exained and thus iprove the perforance of the spatial odel. The way to specify possible relations is based on the eliination of ipossible ones. To eliinate ipossible relations, negative conditions are coposed. Soe intersections (or a cobination of intersections) between topological priitives can never occur in reality, and all the relations that contain these intersections (or the cobination) can be securely excluded. For exaple, the definitions of SSM ensure that the intersection is nonepty for any two objects. This can be expressed verbally as a negative condition "the intersection is always non-epty" and represented according to our notations as: CX 0 On the basis of the 9-intersectin odel and following the "eliination-of-ipossiblerelations" approach, several authors have identified relations between points, lines, surfaces and bodies. Egenhofer and Herring 992, Egenhofer and Franzosa 99, Molenaar et al 994, Kufoniyi 995 investigate relationships between spatial objects in IR 2. Egenhofer 995 presents relations aong body objects in IR 3. De Hoop et al 993 report a ethod to distinguish between ultidiensional objects in IR 3. The outlined possible relations between objects are usually illustrated with drawings, i.e. setches of possible object configurations. ric 993 investigates the largest cobinations of objects, following the condition approach for eliination introduced by van der Meij 992. The study, however, does not provide drawings of the elected configurations. The different conditions used for objects in 2D and 3D space, as well as the lac of a coplete list with drawings for all the possible configurations, have otivated the study presented here. The analysis of the negative conditions used by the authors has revealed a significant variation in the nuber of conditions. Egenhofer and Herring 992 present 23 negative conditions for relations in 2D space, i.e. relations between points, lines and surfaces. To cover the 3D situations, 5 ore conditions have been added by van der Meij 992. ric 993 operates with 40 conditions as 30 of the are used to derive the relations between siple GO in 3D space and 0 to derive the relations between CnsO. In general, the results, i.e. the elected possible relations, can be equivalent despite the different negative conditions applied. However, the selection of a inial set of negative conditions is quite challenging. The verbal description of the negative conditions varies as well. Since ost of the conditions are built on the "if then" construction, the conditional (if) and the consequent (then) part of the stateent could be reversed. The variety of expressions increases with the nuber of intersections involved. For exaple, the condition C5 (see below) can be represented in at least two ore ways depending on which intersection will be entioned in the "if" part. It ay be written as:. If 's interior intersect with 's exterior, then either 's boundary ust intersect with 's exterior or 's interior ust intersect with 's exterior or both, and vice versa. 2. If 's interior does not intersect with 's exterior, then 's exterior cannot intersect only with 's interior.

4 In our experience, the different expressions create difficulties in the coparison of different negative conditions. Therefore, in the following text, the negative conditions, which can be found aong the ones presented by the Egenhofer and Herring 992, are represented by the sae verbal expression. The study on the possible relations has two phases. First, the set of negative conditions is presented. It consists of a coputation of relations and verification by drawings. Second, the obtained relations are investigated for copleteness. second approach based on analysis of possible exterior intersections, is elaborated. 6.. Negative conditions The spatial objects considered are siple objects without holes, tunnels and self-intersecting parts. The conditions are derived fro the topological priitives as they are defined in the spatial odel (see Chapter 5). No special conditions related to soe specific characteristics of the spatial odel are included. Since the spatial objects considered in the odel are the GO naed point, line, surface and body, the corresponding notations P, L, S and will be used to represent the relations. For exaple, R(L,S) eans that the binary relation concerns line and surface as the line is the first object. The relation R(S,L) is the inverse relation, which is referred to by the vice versa part of the condition. In general, the negative conditions are coposed on the basis of possible or non-possible intersections of topological priitives (i.e. interior, boundary and exterior) of two objects. In reality, the intersections between the topological priitives depend on three paraeters: the diension of the objects, the diension of the space (which is used to define a co-diension of the object) and the type of boundary (connected or disconnected). For exaple, the boundary of a surface in IR 2 cannot intersect with the interior of another surface without crossing the boundary. However, this is not the case in IR 3. Due to higher space diension, the boundary of the surface can intersects with the interior of the other surface. The three paraeters, however, cannot be used to define straightforward negative conditions. Unfortunately, each configuration of objects has different paraeters (see Table 6-2). For exaple, the relationships between lines in IR 2 are realised under the following paraeters: the two objects have an object diension one, the space diension is two and both objects have disconnected boundaries. The paraeters for the relationships between surface and surface in IR 3 are different: the object's diension is two, the space diension is three and the boundaries of the surfaces are connected. However, any of the negative conditions are derived on the basis of one or another paraeter that still perits a certain grouping.! " # $ % # & ' ( ) * ( + ' (, % -. / & & ' ' ' % 0 / ) # % ' / ( & Paraeters Diension of objects Co-diension of objects Connectivity of boundaries Objects First Second First Second First Second R(P,P) in D, 2D, 3D 0 0,2,3,2,3 C C R(P,X) in D, 2D, 3D 0,2,3,2,3 0,,2 C D,C R(L,L) in D 0 0 D D R(L,L) in 2D D D R(L,L) in 3D 2 2 D D R(L,S) in 2D 2 0 D C R(L,S) in 3D 2 2 D C R(L,) in 3D D C R(S,S) in 2D C C R(S,S) in 3D 2 2 C C 2

5 R(S,) in 3D C C R(,) in 3D C C The 25 negative conditions defined are classified in 3 groups according to the diension of the objects, the co-diension and connectivity of the boundaries. The conditions -22 apply to objects with non-epty topological priitives. The conditions for points, which are defined with epty interior, are given at the end, i.e. conditions Conditions for binary relations between any objects: R(L,L) in IR, R(L,L), R(S,S), R(L,S) and R(S,L) in IR 2, R(L,L), R(S,S), R(,), R(L,S), R(L,), R(S,), R(S,L), R(,L), R(,S) in IR 3.. The exteriors of two objects always intersect, i.e. R(,) C 0 The condition follows directly fro the definitions. The intersection of the exteriors of two objects is the epty set only if the closure of one of the objects is the universe or the union of closures is the universe. The objects are defined as subsets of the universe U (i.e. the copleent objects are not considered), i.e. U, U and thus ( ) U. The condition eliinates 256 binary relations. 2. If s boundary intersects with s exterior then s interior intersects with s exterior too and vice versa, i.e. C2 a 0 C2 b 0 The condition is related to the continuity of the space and the spatial objects ebedded in it, i.e. if two boundaries do not coincide there is always soe interior or exterior between the. Therefore, if 's boundary intersects with 's exterior, there is 's interior which also intersects. oth parts of the condition ust be applied to all the objects with the sae diension regardless of the diension of the space. The C2 a condition ust be applied to those pairs of objects where the first object has a lower diension, i.e. R(L,S) in IR 2, R(L,S), R(L,) and R(S,) in IR 3. If the condition is applied iediately after C, one part of the condition (C2 a or C2 b ) eliinates 64 relations and both (C2 a and C2 b ) eliinate 2 relations. 3. s boundary intersects with at least one part of and vice versa, i.e. C3 a C3 b The condition follows fro the definitions of the topological priitives. The interior, exterior and boundary are utually exclusive and their union is the universe. Consequently, if two objects belong to one topological space, the boundary of one of the ust intersect at least with one of the topological priitives of the other one. The two parts of the condition hold for all the relations between objects of the sae diension R(L,L) in IR, R(L,L) and R(S,S) in IR 2, R(L,L), R(S,S) and R(,) in IR 3 ). There is no need to apply both parts to objects with different diensions due to the ore restrictive condition C6, which eliinates 3

6 one of the. Thus, the first part of the condition has to be applied to relations where the first object () has the lowest diension (R(L,S) in IR 2, R(L,S), R(L,) and R(S,) in IR 3. The second part is valid for the vice-versa relation (i.e. R(S,L) in IR 2, R(S,L), R(,L), R(,S) in IR 3 ). The condition eliinates 40 relations if both parts are applied. fter the first three negative conditions, the nuber of possible binary relations is reduced to 04 for spatial objects with equal diensions and to 60 between spatial objects with different diensions. 2. Conditions for binary relations between spatial objects of equal diension: R(L,L) in IR, R(S,S) and R(L,L) in IR 2, R(L,L), R(S,S) and R(,) in IR If both interiors are disjoint then s interior intersects with s exterior and vice versa, i.e. C4 a 0 0 C4 b 0 0 If the interiors do not intersect, then the interior of can intersect either with the exterior or boundary of (utually exclusive topological priitives). The objects have the sae diension and therefore the interior of one of the can never coincide copletely with the boundary of the other (the boundary has a lower diension than the interior). This iplies that the interior always intersects with the exterior. 5. If s interior intersects with s boundary, then it ust also intersect with s exterior and vice versa, i.e. C5 a 0 C5 b 0 Since 's interior intersects with 's boundary, 's boundary does not coincide with 's boundary, i.e. there is a part of 's boundary that does not intersect with 's boundary. Due to the sae diension, if the boundaries coincide, then other topological priitives cannot intersect with the. This is to say that and, which iplies that 's closure does not coincide with the boundary either, i.e. =. Hence, 's closure intersects at least with 's exterior, i.e. 0. Further, 's closure is a union set of 's interior and boundary, i.e. ( ) 0, which according to the distributive low gives ( ) ( ) 0. The set union is not the epty set iff ( ) 0 and ( ) 0. Hence, 's interior intersects with 's exterior. One part of the condition is true for the relations between objects with different diension as well, i.e. C5 a for relations when the first object has the higher diension. However, it is not necessary to use this due to the ore restrictive condition C6. 3. Conditions for binary relations between objects of different diensions: R(S,L), R(L,S), R(,L), R(L,), R(,S), and R(S,). 4

7 6. The closure of (the object with the higher diension) always intersects with the exterior of, i.e. R(,) C6 a 0 C6 b 0 C6 c 0 C6 d 0 If the two objects have different diensions, their boundaries never coincide, i.e.. This iplies that both the boundary and the interior of the object of higher diension intersect with the exterior of the object of lower diension. Conditions C6 a and C6 b have to be applied to relations R(S,L), R(S,L), R(,L) and R(,S) and conditions C6 c and C6 d to relations R(L,S), R(L,S), R(L,) and R(S,). 4. Conditions for binary relations between objects of different diensions and at least one of the objects has a zero co-diension: R(L,S) and R(S,L) in IR 2,R(L,) R(S,), R(,L) and R(,S) in IR The interior of always intersects with at least one of the three topological priitives of and vice versa, i.e. C7 a C7 b If both interiors are disjoint, then the interior of the object with the lowest diension (e.g. ) can be a subset of either the boundary or the exterior, or both, of the opposite object (e.g. ). This eans if the interior of does not intersect with the boundary of, it ust intersect with its exterior. The first part of the condition ust be applied to relations where the first object () has the lower diension, i.e. R(L,S) in IR 2, R(L,) and R(S,) in IR 3. C7 b ust be applied to the reverse relations. The condition is true for all the objects of the sae diension, i.e. R(L,L), R(S,S) and R(,), as well. However, the ore restrictive condition C4, which eliinates a larger nuber of relations, is applied in these cases. 5. Conditions for binary relations between objects when at least one of the objects has a zero co-diension: R(L,L) in IR, R(S,S), R(L,S) and R(S,L) in IR 2, R(L,) R(S,), R(,L), R(,S), R(,) in IR If both interiors are disjoint, then s boundary cannot intersect with s interior, i.e. C8 a 0 C8 b 0 Since the co-diension of is 0, the interior of intersects with both 's boundary and interior. 's boundary has to cross 's boundary (due to the co-diension), which requires the existence of a coon interior (continuity of spatial objects). Since the interiors are disjoint, the interior of is disjoint fro the boundary of too. The condition C8 a is relevant for relations R(L,S) in IR 2, R(L,) and R(S,) in IR 3. The condition C8 b has to be applied to relations R(S,L) in IR 2, R(,L) and R(,S) in IR 3. 5

8 9. If s interior intersects with s interior and exterior, then it ust intersect with s boundary too and vice versa, i.e. C9 a 0 C9 b 0 Since the co-diension of is 0, 's interior cannot "leave" the interior to intersect the exterior without crossing 's boundary. 's interior and 's boundary do not intersect and hence 's interior does not intersect with 's exterior. oth conditions have to be applied to relations between objects of the sae diension, i.e. R(L,L), R(S,S) and R(,). The first part of the condition (C9 a ) has to be used for relations between an object with lower diension than object, i.e. R(L,S), R(L,) and R(S,). The second part of the condition is valid for the reverse relations, i.e. R(S,L), R(,L) and R(,S). 6. Conditions for binary relations where at least on of the objects has disconnected boundaries: R(L,L), R(S,L), R(S,L), R(,L), R(L,S), R(L,S), R(L,). The next condition raises when at least one of the objects has disconnected boundaries (i.e. it is valid for lines). The diension of the second object and the co-diension does not influence the condition. Since the line boundary consists of two disconnected nodes, it can intersect at ost with two topological priitives, i.e. 0. s boundary always intersects with two parts of and vice versa, i.e. C0 a C0 b The C0 a condition ust be applied when the first object () in the relation has the higher diension (R(S,L), R(S,L), R(,L)). The C0 b ust be applied when the second () object has the higher diension (R(L,S), R(L,S), R(L,)). oth parts of the condition are valid for the line and line relation. 7. Conditions for binary relations between objects with connected boundaries and at least one of the objects has a zero co-diension: R(S,S) in IR 2, R(S,) and R(,S), R(,) in IR 3.. If s boundary intersects with s interior and exterior, then it ust intersect with s boundary too, i.e. C a 0 C b 0 Since the co-diension of is 0, the connected boundary of can intersect with 's exterior and interior iff it intersects with 's boundary. Thus condition C a is applicable for R (S, ) and conditions C b for condition R(,S) 8. Conditions for binary relations between objects with equal diensions and zero co-diensions: R(L,L) in IR, R(S,S) in IR 2 and R(,) in IR 3. 6

9 The continuity of the spatial objects and the space they are ebedded in, restricts the interior and boundary to utually either intersect, or coincide or be disjoint. In the case of intersection and disjoint, a subset of at least one boundary (interior) always intersects with the opposite exterior (continuity of spatial objects). 2. If both boundaries do not coincide, then at least one boundary ust intersect with the opposite exterior, i.e. C If both interiors do not coincide, then at least one boundary ust intersect with the opposite exterior, i.e. C If 's interior intersect with 's exterior, then 's boundary ust also intersect with 's exterior, i.e. C4 a 0 C4 b 0 9. Conditions for binary relations between objects of the sae diension and nonzero co-diensions: R(L,L) in IR 2 and R(S,S) in IR If s interior is a subset of s interior, then s exterior intersects with both s boundary and s interior and vice versa, i.e. C5 a 0 0 C5 b 0 0 Since the interior of does not intersect with the boundary and exterior of, the boundary of does not intersect either. Consequently, 's exterior ust intersect with both 's interior and boundary. The condition is also true for every two objects of the sae diension but when the co-diension is zero the ore restrictive condition C4 is applied. The non-zero co-diension allows intersection of interior and opposite exterior without crossing the boundary, therefore C4 cannot be used for the relations R(L,L) in IR 2 and R(S,S) in IR If s interior intersects with s boundary but s boundary do not intersect with s interior, then s boundary ust intersect with s exterior and vice versa, i.e. C6 a 0 0 C6 b 0 0 If 's interior intersects with 's boundary without crossing 's boundary, then 's interior is a subset of either 's interior or 's exterior (due to greater than zero codiension). In both cases, the exterior of intersects with 's boundary. The condition is true for relations between objects of the sae diension and zero co-diension as well. In 7

10 this case, however, 's interior is only a subset of 's interior, which can be achieved by applying condition Conditions for binary relations objects of the sae diension with connected boundaries and non-zero co-diension: R(S,S) in IR 3. s was entioned, self-intersecting spatial objects are not allowed in the spatial odel and therefore they are excluded fro the list of possible relations The conditions listed below eliinate closed surfaces (see Figure 6-). 7. If s interior does not intersect with s boundary and s boundary does not intersect with s interior, then both boundaries either intersect or not with both exteriors, i.e. C7 a C7 b If s interior and boundary intersects respectively with s boundary and interior, then at least one boundary intersects with the exterior of the other object, i.e. C8 a 0 0 C8 b If s closure intersects with s closure, then it ust intersect with s exterior too, and vice versa, i.e. C9 a 0 C9 b 0 a) R37/343 b) R309 c) R437/469 d) R445/47 R279/285 R407/43 R373 R50 R503/R509 e) f) g) h) i) surface surface surface of intersection / edge of intersection / : ; < = 6 C 6 E 4 5 C = D 6. Conditions for binary relations between objects of different diensions, a nonzero co-diension and at least one of the with disconnected boundaries: R(S, L) and R(L, S) in IR 3. 8

11 20. If s interior intersects with s boundary but not s interior, then s interior ust intersect with s exterior, i.e. R(,) C20a 0 0 C20 b 0 0 The condition C20 a is valid for the relation R ( S, L), while C20 b holds for the opposite line and surface relation, i.e. R ( L, S). s can be realised, the condition is true for all the relations between objects with different diensions; however, when the co-diension is zero, condition C8, which is ore restrictive, is applied. 2. If the boundary of intersects with the boundary of but the interior of does not intersect with both the interior and boundary of, then the interior ust intersect with the exterior of, i.e. R(,) C2a C2 b The condition Cs2 a is valid for the relation R ( S, L), while C2 b holds for the opposite line and surface relation, i.e. R ( L, S). It is apparent that the condition is true for all the relations between objects with different diensions; however, if the co-diension equals zero, the ore restrictive condition C7 is applied. 2. Conditions for binary relations between objects of equal diension, non-zero codiension and disconnected boundaries: R(L,L) in IR 2 and IR If 's boundary is a subset of 's boundary, then the two boundaries coincide and vice versa, i.e. C22 a 0 0 C22 b 0 0 ccording to definition 4, boundaries of and are sets of exactly two nodes. Then if 's boundary is a subset of 's boundary, then the two nodes ust be a subset of 's boundary. However 's boundary is also a set of exactly two nodes. This iplies that both boundaries ust coincide, i.e. Let = {{ N i },{ N j }}, = {{ N },{ N l }} and. This iplies that {{ N i},{ N j }} {{ N },{ N l }}. Since the cardinality of the two sets is equal, then either { i N } = { N } and N } = { N } or N } = { N } and N } = { N }. { j l { i l { j 3. Conditions for binary relations between objects with at least one epty interior: R(P,P), R(P,L), R(P,S), R(P.), R(L,P), R(S,P), R(,P). 23. If 's interior is the epty set, all the intersections between 's interior and 's topological priitives will be the epty set and vice versa, i.e. C23 a 9

12 C23 b C23 c C23 d C23 e 24. 's boundary intersects only with one part of and vice-versa, i.e. C24 a C24 b C24 c C24 d C24 e C24 f 25. If 's boundary does not intersect with 's boundary, then 's exterior ust intersect with 's boundary and vice versa, i.e. C25 a 0 0 C25 b 0 0 The set of 25 negative conditions presented here is the inial set reported currently in the literature Possible relations The negative conditions defined above are applied to identify topological binary relations between siple spatial objects regardless of the space in which they are ebedded (i.e. IR, IR 2, or IR 3 ).. progra written in J coputes the possible relations. R03 disjoint R287 eet R79 contains R435 covers R220 inside R476 coveredy R400 equal R255 overlap F G H I J K L M N O P G Q K R Q S T G Q K G Q U V O W J K T R X G Y Q Z Line and line relations in IR: Lines are spatial objects with disconnected boundaries and connected interior. Ebedded in IR, their co-diension is zero (see Table 6-2). Therefore the following conditions have to be applied: C, C2 a, C2 b, C3 a, C3 b, C4 a, C4 b, C5 a, C5 b C8 a, C8 b, C9 a, C9 b, C0 a, C0 b, C2, C3, C4 a and C4 b. Since the two objects have the sae diension both parts of all the conditions have to be used. The nuber of identified possible relations is eight (see Figure 6-2 and ppendix 3) and they are given the naes: disjoint, contains, inside, equal, eet, covers, coveredy, overlap. 20

13 Line and line relations in IR 2 and IR 3 : The negative conditions for R(L,L) in IR 2 and IR 3 are C, C2 a, C2 b, C3 a, C3 b, C4 a, C4 b, C5 a, C5 b, C0 a, C0 b, C5 a, C5 b C6 a, C6 b, C22 a and C22 b. Lines ebedded in IR 2 or IR 3 have disconnected boundaries and connected interior but the co-diension is non-zero. Therefore, the negative conditions that have to be applied belong to the following groups: conditions for all objects, conditions for objects of the sae diension, conditions for objects with disconnected boundaries, conditions for objects of the sae diension and non-zero co-diension, and conditions for line and line relations in IR 2 and IR 3. The nuber of all the relations is 33. Figure 6-3 presents a geoetric interpretation of all the relations. Egenhofer and Herring 992 report the sae nuber of relations; however the nuber of conditions with all their parts is 20. Molenaar et al 994 report 22 relations. Drawings with their possible geoetric configurations are shown in Kofuniyi 995. R03 R25 R22 R287 R45 R055 R27 R223 R3 R435 R063 R59 R245 R349 R439 R093 R79 R247 R373 R476 R095 R83 R253 R477 R7 R9 R255 R400 R9 R220 R277 R405 R50 [ \ ] ^ _ ` a b c d e \ f ` g f h i \ f ` \ f j l d c c _ ` i g \ n f o Surface and line in IR 2 : The configuration surfaces and line falls in the groups of objects with different diensions, at least one non-zero co-diension and one disconnected boundary, i.e. the negative conditions for R (S, L) are: C, C2 b, C3 b, C6 a, C6 b, C7 b, C8 b, C9 b and C0 a. The conditions leave 9 possible relations. The exaples of geoetric representations are shown in Figure 6-4 (the cases when the surface is represented as a rectangle). Egenhofer and Herring 992 and Molenaar et al 994 report the sae binary relations. Egenhofer and Herring 992 use one condition less but obtain one relation ore, i.e. R5, which is ipossible for siple line and surface. Surface and line in IR 3 : Surface and line ebedded in IR 3 have the sae properties as surface and line in IR 2, however the co-diension is non-zero (see Table 6-2). The non-zero co-diension perits 2 ore configurations than in IR 3, i.e. the total nuber of all the possible relations is 3 (see Figure 6-4). The conditions used for the relation R(S,L) are: C, 2

14 C2 b, C3 b, C6 a, C6 b, C0 a C20 a and C2 a. ric 993 obtains the sae binary relations but applying 4 conditions (counting all the parts of the condition. ody and line in IR 3 : Configurations between body and line can exist only in IR 3, i.e. one of the co-diensions is always zero. The two objects have different diensions and one of the has disconnected boundaries. These properties require utilisation of the following negative conditions for R(,L): C, C2 b, C3 b, C6 a, C6 b, C7 b, C8 b, C9 b and C0 a. The viceversa relation R(L,) requires conditions C, C2 a, C3 a, C6 c, C6 d, C7 a, C8 a, C9 a and C0 b. coparison with the configuration surface and line in IR 2 shows that the negative conditions are identical and, consequently, the nuber of possible relations is 9. Exaples of possible geoetric configurations are shown in Figure 6-8. ppendix 3, Table, contains the decial codes of all the relations, i.e. R(L,) (on the left) and R(,L) (on the right). ric 993 reports the sae relations, applying 5 conditions. De Hoop et al 993 clai the sae nuber relations without details on conditions and drawings. R439 R03 R27 R223 R287 R375 R467 R055 R59 R243 R3 R403 R47 R407 R063 R79 R247 R339 R479 R095 R83 R255 R343 R45 R499 R9 R9 R279 R35 R435 R503 p q r s t u v w x y z s t { } u ~ q ~ u q ~ ƒ y t u q ~ ˆ Š q ~ Œ Surface and surface in IR 2 : The configuration surface and surface in IR 2 has the following properties: connected boundaries, equal diensions and zero co-diensions. This iplies that the following negative condition has to be selected: C, C2 a, C2 b, C3a, C3 b, C4 a, C4 b, C5 a, C5 b, C8 a, C8 b, C9 a, C9 b, C a, C b, C2, C3, C4 a and C4 b. The conditions are siilar to the ones applied to the relation between line and line in IR. The only difference is C0, which is replaced with C. Thus the nuber of relations is the sae, i.e. 8, however, one relation, i.e. R5 is new. Figure 6-5shows geoetric representation of the possible configurations. Visually, the relation R5 is the sae as R255 (see Figure 6-2), i.e. both objects overlap each other. However, the binary (decial) representation or relation is different. This relation is a typical exaple of probable isleading about the real interaction 22

15 between the objects if only literal description is used. More details concerning the naes of the relations will be provided later. Egenhofer and Herring 992 have obtained the sae relations using 20 conditions. Surface and surface in IR 3 : The possible relations between surface and surface are deterined by the following properties: equal diension, connected boundaries and non-zero co-diension. Since the co-diension is greater than zero, the surfaces have the "freedo" to touch their interiors without intersection of boundaries and therefore ore relations are obtained. Thus, only the first five conditions, i.e. C, C2 a, C2 b, C3a, C3 b, C4 a, C4 b, C5 a and C5 b are considered of all the ones used for R(S,S) in IR 2. In addition, C5 a, C5 b, 6 a, 6 b, the four parts of C7, C8 a, C8 b, C9 a and C9 b, ust applied to avoid self-intersecting boundaries (see Figure 6-). The nuber of obtained relations is 38 (see Figure 6-7 and ppendix 3). R03 disjoint R287 eet R03 disjoint R287 eet R79 contains R435 covers R79 contains R435 covers R220 inside R476 coveredy R220 inside R476 coveredy R400 equal R5 overlap Ž š œ š Ž ž Ÿ Ž R400 equal R5 overlap Ž œ œ œ Ž ž Ÿ Ž ric 993 is the only author reporting the atrices with relations between surfaces in IR 3 (De Hoop et al 993 give only the nuber of relations 47). The obtained relations however are different. Relations R7, R59, R277 and R405 are not elected as possible and 2 new relations are reported, which (in our judgeent) require self-intersecting surfaces. The 2 new relations are R279, R285, R37, R3443, R407, R42, R433, R445, R47, R50, R503 and R509. Relations R279 and R285 could not be interpreted with any geoetric configuration between siple surfaces; relations R37, R343, R407, R43, R433, R445 and R47 can be realised by self-intersection of one of the surfaces (see Figure 6-). ody and surface in IR 3 : The configuration body surface in IR 3 has siilar characteristics to surface and line in IR 2, i.e. one of the objects has a co-diension zero. However, unless surface (which has connected boundaries), the line has disconnected boundaries (see Table 6-2). Therefore, the condition C0, which refers to disconnected boundaries, ust be replaced with C. Thus the possible relations R(,S) can be obtained by the conditions: C, C2 b, C3 b, C6 a, C6 b, C7 b, C8 b, C9 b and C b. The conditions C, C2 a, C3 a, C6 c, C6 d, C7 a, C8 a, C9 a and C a deterine all the inverse relations, i.e. R(S,). The nuber of the relations is 9 (see Figure 6-9 and ppendix 3). The coparison between surface and line in IR 2, on one hand (see Figure 6-4), and body and surface in IR 3 (see Figure 6-9), on the other hand, shows difference only in one relation, i.e. R255, which is replaced by R5. ric 993 reports the sae nuber of relations obtained with 6 conditions. De Hoop et al 993 give the sae nuber without specifying the nuber of conditions. 23

16 ody and body in IR 3 : The last configuration is equal to the surface and surface in IR 2, i.e. equal diensions, connected boundaries, and zero co-diensions. Therefore the sae negative conditions ust be applied: C, C2 a, C2 b, C3a, C3 b, C4 a, C4 b, C5 a, C5 b, C8 a, C8 b, C9 a, C9 b, C a, C b, C2, C3, C4 a and C4 b. The nuber of possible relations is again 8. Figure 6-6 shows exaples of possible geoetric configurations. Point and point: Since the points are objects with epty interior and equal diensions, the conditions that to be applied are C, C23 a, C23 b, C23 c, C23 d, C23 e, C24 b, C24 e, C25 a and C25 b. These conditions eliinate 50 relations and leave only two, i.e. equal and disjoint. Point and any other object X: R(P,X), R(X,P). The relations between a point and any other object are only three, i.e. a point can be disjoint, lay on the boundary of an object or on its interior. These configurations can be obtained by applying conditions for R(P,X): C, C3 a, C6 c, C6 d C23 a, C23 b, C23 c, C24 a, C24 b, C24 c and C25 a.the reverse relations R(X,P) require the conditions: C, C3 b, C6 a, C6 b C23 a, C23 d, C23 e, C24 d, C24 e, C24 f and C25 b. R03 R59 R277 R405 R287 R45 R063/R095 R220/R79 R349/R3 R435/R476 R093/R055 R7 R22/R83 R223/R9 R39/R35 R447/R479 R9/25 R247/253 R375/R38 R477/R439 R383 R5 R27 R255 R400 ª «± ² ³ µ µ ¹ µ ª º» ¼ ² ½ ¾ µ À ª Á ¹ 24

17 R03 R252 R287 R42 R447 R063 R253 R36 R45 R508 R9 R255 R37 R444 R509 R220 R285 R39 R445 body line face of intersection node of intersection Â Ã Ä Å Æ Ç È É Ê Ë Ì Í Î Ï Ð Ñ Î Ò Ã Ñ Ç Ã Ñ Ó Ô Õ Ë Ö Æ Ç Ò Ð Ø Ã Í Ñ Ù R03 R252 R36 R444 R508 R063 R253 R37 R445 R509 R9 R285 R39 R447 R5 R220 R287 R42 R476 surface body Â Ã Ä Å Æ Ç È É Ë Ì Í Î Ï Ð Ñ Î face of intersection line of intersection Ù Å Æ Ú Ð Û Ç Ã Ñ Ó Ô Õ Ë Ö Æ Ç Ò Ð Ø Ã Í Ñ Ù 25

18 ll the possible relations coputed on the basis of the negative conditions are given in ppendix 3. The total nuber of all the binary relations between siple objects according to the 9-intersection odel is 69. Table (ppendix 3) contains the binary relations and the corresponding decial codes. The relations are sorted in an ascending order according to the decial code. The decial coding places relations with less non-epty intersections between interior and boundary at the top of the table and relations with ore non-epty intersections at the botto of the table. Since the first four coluns represent the closure intersections, the 6 relations according to the 4-intersection odel can clearly be distinguished fro the additionally identified ones according to the 9-intersection odel. The relations in the table are subdivided into 6 groups corresponding to the 6 closure intersections. Four closure relations have inverse relations, i.e. the relations of groups 2&3, 6&7, 0& and 4&5. Such relations can be represented by one geoetric configuration of spatial objects (e.g. Figure 6-6 and Figure 6-7) Copleteness of the obtained relations The copleteness of the relations is of great iportance to the developent of algoriths and operations to identify relations. s can be observed fro the setches, any relations of spatial objects belong to only one group of relations (see also ppendix 3). For exaple, surface and line can relate according to the relation R375 (see Figure 6-4). The relation belongs to group 2. Since the configuration does not have another relation fro this group, the closure intersection is sufficient to conclude in support or against the relation. Thus the operations related to inspection of exterior intersection can be oitted. The benefit will be the iproved perforance of the spatial queries based on this topological relation. Such shortening of the query process is affordable only if the copleteness of the possible relations is ensured. The procedure followed above relies on the correct coposition of negative conditions. Drawings of the possible configurations of spatial objects are used for final approval of the resulting relations. The approach has the wea characteristic that it cannot control the strictness of the negative conditions. Soe ris exists that a condition ight be too strict and cause eliination of configurations that are realisable in reality. The relaxed conditions that leave relations can be identified as wrong by the final proof (setches of spatial objects) afterwards. The final proof, however, cannot detect oission of possible relations. For exaple, the conditions presented by ric 993 for the surface and surface configuration eliinate four possible intersections between siple, non-closed surfaces. This section investigates the relations fro a different viewpoint, i.e. the ephasis is on the possible cobinations between the 6 closure intersections and the 6 exterior intersections. The diension of objects and the diension of the ebedding space are not of priary consideration. Since the exterior of spatial objects is defined as the set difference between the universe and the closure, the intuitive expectation is that there are a very liited nuber of possible intersections. The exterior of the object cannot be restricted to intersect only with the boundary or interior of the object. The exterior of is an open set (by definition) while the closure of is a closed set (by definition), which iplies that they never can coincide. This eans that always there is either 's exterior intersecting with other parts of or 's exterior intersecting with a part of. Thus we can specify a nuber of ipossible exterior 26

19 intersections for any object regardless of diensions and co-diensions. The ipossible intersections are differentiated by the following four stateents:. The exterior of never intersects with only 's boundary or interior and vice versa, which eliinates the following exterior cobinations. E E E E If 's exterior intersects with 's interior, then 's exterior ust intersect with 's interior and vice versa, i.e. the following patterns of exterior intersections are ipossible: E7 0 0 E0 0 0 Since the boundaries of and are closed sets (by definition), they can coincide. If the boundaries coincide then 's exterior ay (or ay not) intersect with 's interior. If the exterior of intersects with 's interior, 's exterior ust intersect at least with one ore part of 's closure (the previous condition). Since 's boundary coincides with 's boundary, 's exterior can intersect only with 's interior. The eliination of all the six ipossible cobinations reduces the possible exterior interceptions to 0. Thus, the nuber of candidate relations according to the 9-intersection odel (considering the intersection ) is decreased to 2. The next two stateents are again true for any configurations of objects, however they have soe exceptions: 3. If 's exterior intersects with 's boundary, it ust also intersect with 's interior and vice-versa (except point objects), i.e. the following exterior intersections do not exist. E 0 0 E2 0 E5 0 The stateent follows directly fro the first stateent. Since the boundary is a closed set, there are soe interior and exterior around it. Since the exterior is a open set and cannot coincide with the boundary (condition E), it ust intersect with the interior. Exceptionally, the above exterior intersections are possible only for point objects. Since a point object does not have any interior (by definition), the intersections cannot be coposed and they are assued epty. Hence, these exterior intersections ust appear only once in the entire list of possible relations. 4. t least one exterior intersects with the closure of the opposite object (except for coinciding objects), i.e. the following exterior intersection is ipossible. E The stateent is not true only for coinciding objects, i.e. this exterior intersection can occur in cobination with closure relation such that interiors and boundaries of the objects 27

20 coincide, i.e. closure relations 9 (see ppendix 3). Since the point object does not have an interior, i.e. = 0, it can occur in cobination with closure relations 9. The 0 cobinations of exterior intersections considered so far leave 0 candidate relations out of the initial 255. The exterior intersections, which are still not analysed, are six in total. Four of the are utually inverse, i.e. E4&E3 and E8&E4, and therefore they are regarded together. The first cobination (E4&E3) eans that one of the objects is inside the other object, i.e. the boundary and the interior do not intersect with the exterior of the opposite object. It is possible only if there is at least one intersection between the boundary of one of the objects and the interior of the other object. nalysis of this pattern shows three possibilities: E4 0 0 E The two exterior intersections cannot be cobined with closure intersections. This situation occurs if the intersection is the epty set and and are both epty or non-epty sets. If both set intersections and are epty, there is no interior that intersects with the opposite closure; hence one of the objects cannot be inside the other one. If they are non-epty, either both interiors intersect or one of the interiors intersects with the exterior of the other object. The only exceptions are the relations between points and objects of higher diension, which is the result of the epty interior of the point. The close relations that fulfil the above rule are,4,5 (due to lac of intersection with a boundary) and close intersection can be cobined only with one of the two exterior intersections. Such closure intersections ust have one non-epty or intersection and at least one epty or intersection. The closure relations that represent these intersections are 2&3, 6&7, 0&. 3. Closure relations can be cobined with both exterior intersections. The case is possible when either both the set intersections and or the three intersections, and are non-epty. The closure relations that fulfil the first stateent are 3, 4, 5 and 6 and closure intersections 8 and 9 satisfy the last two stateents. Thus the nuber of possible relations is 8 (4x0+6x+4x2+2x2=8). E8 0 E4 0 The next cobination refers to the case when one boundary is a subset of either the interior or boundary of the opposite object and thus does not intersect with the exterior. Since the boundary ust intersect with at least one topological priitive, the closure intersections with epty boundary intersections, i.e. and 5, are ipossible to cobine. If only one boundary intersects with the opposite interior but not with the opposite boundary, i.e. 2 and 3, then only one of the exterior parts (E8 or E4) can be cobined. ll other cobinations between the 6 intersections of the closure and both exterior parts ust be possible. This eans that the cobination of the 6 close intersections and the exterior intersection E8 and E4 gives 24 possible relations. 28

21 E6 0 0 The E6 exterior intersections do not perit epty intersections of the boundaries. In fact, the pattern can exist for such closure intersections where the intersection of boundaries is a non-epty set or the intersections and are both epty or nonepty sets. If one of the intersections and is the epty set and the other a nonepty set, then one of the boundaries either intersects with the exterior or self-intersects. This eans that E6 can be cobined with closure relations 4,8,9,2,3 and 6. The last pattern, i.e. all the set intersections are non-epty, can be cobined with all the 6 possibilities of closure intersection, which gives 6 relations. E6 Thus the final nuber of binary relations that ust be possible in reality is 69 (see Table 6-3), which is exactly the nuber of relations derived following the negative conditions defined in the first approach. The second approach has verified the correct total nuber of binary relations. Further study can be carried out to prove the copleteness of each group of relations between any two spatial objects (e.g. line and line, surface and surface), but it is beyond the scope of this thesis. Ü Ý Þ ß à á â ã ä å æ ç Þ à è é ê é ë ë æ è è à ì ë à í é ê à î ï à è ð é è ð ì ï à è í à ë ï ð é ì í Nuber E E E E E E E E8 0 2 E E E 0 0 E2 0 E E4 0 2 E5 0 E6 6 Total 69 It has to be clear that the second approach does not define negative conditions but discusses the possibility and frequency of occurrence of each exterior intersection. However, particular negative conditions can be coposed, which ight have the sae restrictive effect as the conditions in the first approach. For exaple, the negative condition to eliinate the first exterior intersections E2, E5, E7 and E0 ight be: 29

22 If 's exterior intersects with 's interior but not with the boundary, then 's exterior ust intersect at least with 's interior and vice versa. EC a 0 0 EC b 0 0 The literal expression cannot be found in the list of conditions given with the first approach; however, the cobination of restrictive epty non-epty intersections is equivalent to the ones given in the condition C5. C5 in the first approach has a liited range, i.e. it is applied to the relations between only two configurations of objects R(L,L) in IR 2 and R(S,S) in IR 3. ccording to the analysis of exterior intersection, the condition EC ust be applied to all the binary relations between any types of object, regardless of diensions and connectivity of boundaries. This exaple is yet another illustration of the different possibilities to copose negative conditions Topological equivalent spatial relationships lthough the 9-intersection odel recognises ore relations then the 4-intersection odel, it is still not sufficient to describe all the possible ones existing in reality. The basic concept of the odel is the detection of epty or non-epty set intersection between the topological priitives. In practice, the set intersection can be an epty or non-epty set. However, if the intersection is a non-epty set, further investigation of the set intersection is not provided. For exaple, referring to SSM, the non-epty set intersections ight be a node, a set of nodes, a face or a set of faces. Moreover, the set ay have disconnected boundaries or disconnected interiors or both. nother factor that influences the geoetric representations is the nuber and position of the disconnected sets. The variety of non-epty intersections iplies that the object configurations perforing the sae topological relation vary as well. Configurations of objects that reveal the sae topological relation are nown as topologically equivalent. Figure 6-0 and Figure 6- show topologically equivalent surface and surface copositions and Figure 6-2 portrays soe equivalent body and body interactions. Egenhofer and Franzosa 994 present a coprehensive approach to distinguish topologically equivalent relations between regions in 2D space, estiating the diension of the set intersections, connectivity, nuber and order of disconnected sets and the sequence of boundary and boundary coponents. The fraewor is built on the 4-intersection odel. Here, we propose an idea to refine topologically equivalent relations in 3D, judging the non-epty intersections obtained. The estiation of the intersections is copleted on: ) the intersection set between the two objects and 2) the non-epty intersections according to the 9-intersection odel. To illustrate the idea, we will focus on the relation R223 between surface and surface (see Figure 6-0). The relation R223 is represented by seven non-epty and two epty set intersections (see Table 6-4). To evaluate all the non-epty intersections, three paraeters are considered: the diension of the obtained intersections, connectivity and the nuber of disconnected intersections. The following notations are used: c-connected set, d-disconnected set, cb-connected boundary set; db-disconnected boundary set, ciconnected interior set, di-disconnected interior set. The type of intersections is denoted by n- a node, nn-a set of nodes, f-a face, ff-a set of faces. 30

Gromov-Hausdorff Distance Between Metric Graphs

Gromov-Hausdorff Distance Between Metric Graphs Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value

More information

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues

Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues Mapping Data in Peer-to-Peer Systes: Seantics and Algorithic Issues Anastasios Keentsietsidis Marcelo Arenas Renée J. Miller Departent of Coputer Science University of Toronto {tasos,arenas,iller}@cs.toronto.edu

More information

O Type of array element

O Type of array element ! " #! $ % % # & : ; a ontiguous sequene of variables. all of the sae type. Eah variable is identified by its index. Index values are integers. Index of first entry is. ' ( ) * + May /,. - ( & ( ( J K

More information

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks

Investigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,

More information

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.

Structural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl. Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable

More information

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem

Theoretical Analysis of Local Search and Simple Evolutionary Algorithms for the Generalized Travelling Salesperson Problem Theoretical Analysis of Local Search and Siple Evolutionary Algoriths for the Generalized Travelling Salesperson Proble Mojgan Pourhassan ojgan.pourhassan@adelaide.edu.au Optiisation and Logistics, The

More information

Different criteria of dynamic routing

Different criteria of dynamic routing Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich

More information

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13

Computer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13 Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical

More information

Verifying the structure and behavior in UML/OCL models using satisfiability solvers

Verifying the structure and behavior in UML/OCL models using satisfiability solvers IET Cyber-Physical Systes: Theory & Applications Review Article Verifying the structure and behavior in UML/OCL odels using satisfiability solvers ISSN 2398-3396 Received on 20th October 2016 Revised on

More information

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering

Clustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into

More information

CS 361 Meeting 8 9/24/18

CS 361 Meeting 8 9/24/18 CS 36 Meeting 8 9/4/8 Announceents. Hoework 3 due Friday. Review. The closure properties of regular languages provide a way to describe regular languages by building the out of sipler regular languages

More information

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi

Brian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.

More information

λ-harmonious Graph Colouring Lauren DeDieu

λ-harmonious Graph Colouring Lauren DeDieu λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex

More information

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization

Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization 1 Defining and Surveying Wireless Link Virtualization and Wireless Network Virtualization Jonathan van de Belt, Haed Ahadi, and Linda E. Doyle The Centre for Future Networks and Counications - CONNECT,

More information

1 Extended Boolean Model

1 Extended Boolean Model 1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible

More information

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands

Oblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu

More information

The Internal Conflict of a Belief Function

The Internal Conflict of a Belief Function The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of

More information

Boosted Detection of Objects and Attributes

Boosted Detection of Objects and Attributes L M M Boosted Detection of Objects and Attributes Abstract We present a new fraework for detection of object and attributes in iages based on boosted cobination of priitive classifiers. The fraework directly

More information

An Architecture for a Distributed Deductive Database System

An Architecture for a Distributed Deductive Database System IEEE TENCON '93 / B eih An Architecture for a Distributed Deductive Database Syste M. K. Mohania N. L. Sarda bept. of Coputer Science and Engineering, Indian Institute of Technology, Bobay 400 076, INDIA

More information

A Novel Fast Constructive Algorithm for Neural Classifier

A Novel Fast Constructive Algorithm for Neural Classifier A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore

More information

Identifying Converging Pairs of Nodes on a Budget

Identifying Converging Pairs of Nodes on a Budget Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering

More information

A simplified approach to merging partial plane images

A simplified approach to merging partial plane images A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D

More information

Cassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards

Cassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense

More information

Novel Image Representation and Description Technique using Density Histogram of Feature Points

Novel Image Representation and Description Technique using Density Histogram of Feature Points Novel Iage Representation and Description Technique using Density Histogra of Feature Points Keneilwe ZUVA Departent of Coputer Science, University of Botswana, P/Bag 00704 UB, Gaborone, Botswana and Tranos

More information

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents

More information

Geo-activity Recommendations by using Improved Feature Combination

Geo-activity Recommendations by using Improved Feature Combination Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,

More information

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL

COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute

More information

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems

Design Optimization of Mixed Time/Event-Triggered Distributed Embedded Systems Design Optiization of Mixed Tie/Event-Triggered Distributed Ebedded Systes Traian Pop, Petru Eles, Zebo Peng Dept. of Coputer and Inforation Science, Linköping University {trapo, petel, zebpe}@ida.liu.se

More information

Trees. Linear vs. Branching CSE 143. Branching Structures in CS. What s in a Node? A Tree. [Chapter 10]

Trees. Linear vs. Branching CSE 143. Branching Structures in CS. What s in a Node? A Tree. [Chapter 10] CSE 143 Trees [Chapter 10] Linear vs. Branching Our data structures so far are linear Have a beginning and an end Everything falls in order between the ends Arrays, lined lists, queues, stacs, priority

More information

Summary. Reconstruction of data from non-uniformly spaced samples

Summary. Reconstruction of data from non-uniformly spaced samples Is there always extra bandwidth in non-unifor spatial sapling? Ralf Ferber* and Massiiliano Vassallo, WesternGeco London Technology Center; Jon-Fredrik Hopperstad and Ali Özbek, Schluberger Cabridge Research

More information

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm

Detection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,

More information

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE

TALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE 7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,

More information

Feature Based Registration for Panoramic Image Generation

Feature Based Registration for Panoramic Image Generation IJCSI International Journal of Coputer Science Issues, Vol. 10, Issue 6, No, Noveber 013 www.ijcsi.org 13 Feature Based Registration for Panoraic Iage Generation Kawther Abbas Sallal 1, Abdul-Mone Saleh

More information

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS

OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented

More information

M a c intosh Cyr i l lic Lang u age Ki t. Installation and User s Manual Manuel d installation et d u t i l i s a t i o n

M a c intosh Cyr i l lic Lang u age Ki t. Installation and User s Manual Manuel d installation et d u t i l i s a t i o n apple M a c intosh Cyr i l lic Lang u age Ki t Installation and User s Manual Manuel d installation et d u t i l i s a t i o n K Apple Coputer, Inc. This anual and the software described in it are copyrighted

More information

Geometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.

Geometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem. Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)

More information

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed

Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,

More information

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing

A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing A Trajectory Splitting Model for Efficient Spatio-Teporal Indexing Slobodan Rasetic Jörg Sander Jaes Elding Mario A. Nasciento Departent of Coputing Science University of Alberta Edonton, Alberta, Canada

More information

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification

Solving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural

More information

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang

POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION. Junjun Jiang, Ruimin Hu, Zhen Han, Tao Lu, and Kebin Huang IEEE International Conference on ultiedia and Expo POSITION-PATCH BASED FACE HALLUCINATION VIA LOCALITY-CONSTRAINED REPRESENTATION Junjun Jiang, Ruiin Hu, Zhen Han, Tao Lu, and Kebin Huang National Engineering

More information

Privacy-preserving String-Matching With PRAM Algorithms

Privacy-preserving String-Matching With PRAM Algorithms Privacy-preserving String-Matching With PRAM Algoriths Report in MTAT.07.022 Research Seinar in Cryptography, Fall 2014 Author: Sander Sii Supervisor: Peeter Laud Deceber 14, 2014 Abstract In this report,

More information

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System

Designing High Performance Web-Based Computing Services to Promote Telemedicine Database Management System Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,

More information

Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design

Design and Implementation of Business Logic Layer Object-Oriented Design versus Relational Design Design and Ipleentation of Business Logic Layer Object-Oriented Design versus Relational Design Ali Alharthy Faculty of Engineering and IT University of Technology, Sydney Sydney, Australia Eail: Ali.a.alharthy@student.uts.edu.au

More information

THE rapid growth and continuous change of the real

THE rapid growth and continuous change of the real IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa

More information

Carving Differential Unit Test Cases from System Test Cases

Carving Differential Unit Test Cases from System Test Cases Carving Differential Unit Test Cases fro Syste Test Cases Sebastian Elbau, Hui Nee Chin, Matthew B. Dwyer, Jonathan Dokulil Departent of Coputer Science and Engineering University of Nebraska - Lincoln

More information

Transformations. Prof. George Wolberg Dept. of Computer Science City College of New York

Transformations. Prof. George Wolberg Dept. of Computer Science City College of New York Transforations Prof. George Wolberg Dept. of Coputer Science City College of New York Objectives Introduce standard transforations - Rotations - Translation - Scaling - Shear Derive hoogeneous coordinate

More information

Approaching the Skyline in Z Order

Approaching the Skyline in Z Order Approaching the Skyline in Z Order KenC.K.Lee Baihua Zheng Huajing Li Wang-Chien Lee cklee@cse.psu.edu bhzheng@su.edu.sg huali@cse.psu.edu wlee@cse.psu.edu Pennsylvania State University, University Park,

More information

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH

ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.

More information

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University

More information

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks

Energy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr

More information

The Unit Bar Visibility Number of a Graph

The Unit Bar Visibility Number of a Graph The Unit Bar Visibility Nuber of a Graph Eily Gaub 1,4, Michelle Rose 2,4, and Paul S. Wenger,4 August 20, 2015 Abstract A t-unit-bar representation of a graph G is an assignent of sets of at ost t horizontal

More information

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation

Quantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University

More information

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH

NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH NON-RIGID OBJECT TRACKING: A PREDICTIVE VECTORIAL MODEL APPROACH V. Atienza; J.M. Valiente and G. Andreu Departaento de Ingeniería de Sisteas, Coputadores y Autoática Universidad Politécnica de Valencia.

More information

Image Filter Using with Gaussian Curvature and Total Variation Model

Image Filter Using with Gaussian Curvature and Total Variation Model IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.

More information

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco

IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of

More information

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2

Database Design on Mechanical Equipment Operation Management System Zheng Qiu1, Wu kaiyuan1, Wu Chengyan1, Liu Lei2 2nd International Conference on Advances in Mechanical Engineering and Industrial Inforatics (AMEII 206) Database Design on Mechanical Equipent Manageent Syste Zheng Qiu, Wu kaiyuan, Wu Chengyan, Liu Lei2

More information

Keyword Search in Spatial Databases: Towards Searching by Document

Keyword Search in Spatial Databases: Towards Searching by Document IEEE International Conference on Data Engineering Keyword Search in Spatial Databases: Towards Searching by Docuent Dongxiang Zhang #1, Yeow Meng Chee 2, Anirban Mondal 3, Anthony K. H. Tung #4, Masaru

More information

Medical Biophysics 302E/335G/ st1-07 page 1

Medical Biophysics 302E/335G/ st1-07 page 1 Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative

More information

Homework 1. An Introduction to Neural Networks

Homework 1. An Introduction to Neural Networks Hoework An Introduction to Neural Networks -785: Introduction to Deep Learning Spring 09 OUT: January 4, 09 DUE: February 6, 09, :59 PM Start Here Collaboration policy: You are expected to coply with the

More information

AN APPROACH ON BIMODAL BIOMETRIC SYSTEMS

AN APPROACH ON BIMODAL BIOMETRIC SYSTEMS AN APPROACH ON BIODAL BIOETRIC SYSTES Eugen LUPU, Siina EERICH Technical University of Cluj-Napoca, 26-28 Baritiu str. Cluj-Napoca phone: +40-264-40-266; fax: +40-264-592-055; e-ail: Eugen.Lupu @co.utcluj.ro

More information

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints

An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints 519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka

More information

M Software management

M Software management M Software anageent This docuent is part of the UCISA Inforation Security Toolkit providing guidance on the policies and processes needed to ipleent an organisational inforation security policy. To use

More information

INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS

INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS INTERLEAVED DIMENSION DECOMPOSITION: A NEW DECOMPOSITION METHOD FOR WAVELETS AND ITS APPLICATION TO COMPUTER GRAPHICS Manfred Kopp and Werner Purgathofer Vienna University of Technology Institute of Coputer

More information

1 P a g e. F x,x...,x,.,.' written as F D, is the same.

1 P a g e. F x,x...,x,.,.' written as F D, is the same. 11. The security syste at an IT office is coposed of 10 coputers of which exactly four are working. To check whether the syste is functional, the officials inspect four of the coputers picked at rando

More information

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches

Efficient Estimation of Inclusion Coefficient using HyperLogLog Sketches Efficient Estiation of Inclusion Coefficient using HyperLogLog Sketches Azade Nazi, Bolin Ding, Vivek Narasayya, Surajit Chaudhuri Microsoft Research {aznazi, bolind, viveknar, surajitc}@icrosoft.co ABSTRACT

More information

Discrete Fourier Transform

Discrete Fourier Transform Discrete Fourier Transfor This is the first tutorial in our ongoing series on tie series spectral analysis. In this entry, we will closely exaine the discrete Fourier transfor (aa DFT) and its inverse,

More information

Guillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for

Guillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May

More information

Automatic Graph Drawing Algorithms

Automatic Graph Drawing Algorithms Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs

More information

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3

TensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3 2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition

More information

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model

Optimized stereo reconstruction of free-form space curves based on a nonuniform rational B-spline model 1746 J. Opt. Soc. A. A/ Vol. 22, No. 9/ Septeber 2005 Y. J. Xiao and Y. F. Li Optiized stereo reconstruction of free-for space curves based on a nonunifor rational B-spline odel Yi Jun Xiao Departent of

More information

Distributed Multicast Tree Construction in Wireless Sensor Networks

Distributed Multicast Tree Construction in Wireless Sensor Networks Distributed Multicast Tree Construction in Wireless Sensor Networks Hongyu Gong, Luoyi Fu, Xinzhe Fu, Lutian Zhao 3, Kainan Wang, and Xinbing Wang Dept. of Electronic Engineering, Shanghai Jiao Tong University,

More information

Vito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin

Vito R. Gervasi, Adam Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin GEOMETRY AND PROCEDURE FOR BENCHMARKING SFF AND HYBRID FABRICATION PROCESS RESOLUTION Vito R. Gervasi, Ada Schneider, Joshua Rocholl the Milwaukee School of Engineering, Milwaukee, Wisconsin ABSTRACT Since

More information

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1

Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1 UNIVERSITY OF EAST ANGLIA School of Coputing Sciences Main Series UG Exaination 2016-17 GRAPHICS 1 CMP-5010B Tie allowed: 2 hours Answer THREE questions. Notes are not peritted in this exaination Do not

More information

Relief shape inheritance and graphical editor for the landscape design

Relief shape inheritance and graphical editor for the landscape design Relief shape inheritance and graphical editor for the landscape design Egor A. Yusov Vadi E. Turlapov Nizhny Novgorod State University after N. I. Lobachevsky Nizhny Novgorod Russia yusov_egor@ail.ru vadi.turlapov@cs.vk.unn.ru

More information

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math

Smarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents

More information

Generating Mechanisms for Evolving Software Mirror Graph

Generating Mechanisms for Evolving Software Mirror Graph Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror

More information

Error estimation of bathymetric grid models derived from historic and contemporary datasets 1 Introduction

Error estimation of bathymetric grid models derived from historic and contemporary datasets 1 Introduction Error estiation of bathyetric grid odels derived fro historic and conteporary datasets Martin Jakobsson, Brian Calder, Larry Mayer and Andy Arstrong Center for Coastal and Ocean Mapping, University of

More information

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011

EE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011 EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction

More information

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms

Scheduling Parallel Real-Time Recurrent Tasks on Multicore Platforms IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL., NO., NOV 27 Scheduling Parallel Real-Tie Recurrent Tasks on Multicore Platfors Risat Pathan, Petros Voudouris, and Per Stenströ Abstract We

More information

Ranking Spatial Data by Quality Preferences

Ranking Spatial Data by Quality Preferences 1 Ranking Spatial Data by Quality Preferences Man Lung Yiu, Hua Lu, Nikos Maoulis, and Michail Vaitis Abstract A spatial preference query ranks objects based on the qualities of features in their spatial

More information

Short Papers. Location- and Density-Based Hierarchical Clustering Using Similarity Analysis 1 INTRODUCTION

Short Papers. Location- and Density-Based Hierarchical Clustering Using Similarity Analysis 1 INTRODUCTION IEEE TRASACTIOS O PATTER AALYSIS AD MACHIE ITELLIGECE, VOL. 20, O. 9, SEPTEMBER 1998 1011 Short Papers Location- and Density-Based Hierarchical Clustering Using Siilarity Analysis Peter Bacsy and arendra

More information

3 Conference on Inforation Sciences and Systes, The Johns Hopkins University, March, 3 Sensitivity Characteristics of Cross-Correlation Distance Metric and Model Function F. Porikli Mitsubishi Electric

More information

Cartons (PCCs) Management

Cartons (PCCs) Management Final Report Project code: 2015 EE04 Post-Consumer Tetra Pak Cartons (PCCs) Management Prepared for Tetra Pak India Pvt. Ltd. Post Consumer Tetra Pak Cartons (PCCs) Management! " # $ " $ % & ' ( ) * +,

More information

Massive amounts of high-dimensional data are pervasive in multiple domains,

Massive amounts of high-dimensional data are pervasive in multiple domains, Challenges of Feature Selection for Big Data Analytics Jundong Li and Huan Liu, Arizona State University Massive aounts of high-diensional data are pervasive in ultiple doains, ranging fro social edia,

More information

An Efficient Approach for Content Delivery in Overlay Networks

An Efficient Approach for Content Delivery in Overlay Networks An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr

More information

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction

A Broadband Spectrum Sensing Algorithm in TDCS Based on ICoSaMP Reconstruction MATEC Web of Conferences 73, 03073(08) https://doi.org/0.05/atecconf/087303073 SMIMA 08 A roadband Spectru Sensing Algorith in TDCS ased on I Reconstruction Liu Yang, Ren Qinghua, Xu ingzheng and Li Xiazhao

More information

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm

Problem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and

More information

Structuring Business Metadata in Data Warehouse Systems for Effective Business Support

Structuring Business Metadata in Data Warehouse Systems for Effective Business Support Structuring Business Metadata in Data Warehouse Systes for Effective Business Support arxiv:cs/0110020v1 [cs.db] 8 Oct 2001 N.L. Sarda Departent of Coputer Science and Engineering Indian Institute of Technology

More information

Entity-Relationship Models of Information Artefacts

Entity-Relationship Models of Information Artefacts Entity-Relationship Models of Inforation Artefacts T. R. G. Green MRC Applied Psychology Unit 5 Chaucer Rd, Cabridge CB2 2EF thoas.green@rc-apu.ca.ac.uk http: //www.rc-apu.ca.ac.uk/personal/thoas.green/

More information

Performance Analysis of RAID in Different Workload

Performance Analysis of RAID in Different Workload Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,

More information

Development of a Computer Application to Simulate Porous Structures

Development of a Computer Application to Simulate Porous Structures Vol. Materials 5, No. Research, 3, 00Vol. 5, No. 3, 75-79, 00. Developent of a Coputer Application to Siulate Porous Structures 00 75 Developent of a Coputer Application to Siulate Porous Structures S.C.

More information

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression

Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Efficient Learning of Generalized Linear and Single Index Models with Isotonic Regression Sha M. Kakade Microsoft Research and Wharton, U Penn skakade@icrosoft.co Varun Kanade SEAS, Harvard University

More information

Functions: Review of Algebra and Trigonometry

Functions: Review of Algebra and Trigonometry Sec. and. Functions: Review of Algebra and Trigonoetry A. Functions and Relations DEFN Relation: A set of ordered pairs. (,y) (doain, range) DEFN Function: A correspondence fro one set (the doain) to anther

More information

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm

Shortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University

More information

Towards an Analysis of Range Query Performance in Spatial Data Structures*

Towards an Analysis of Range Query Performance in Spatial Data Structures* Towards an Analysis of Range Query Perforance in Spatial Data Structures* Bernd-Uwe Pagel** Hans-Werner Six** Heinrich Toben** Peter Widayer~ Abstract In this paper, we otivate four different user defined

More information

Two hours UNIVERSITY OF MANCHESTER. January Answer any THREE questions. Answer each question in a separate book

Two hours UNIVERSITY OF MANCHESTER. January Answer any THREE questions. Answer each question in a separate book Two hours UNIVERSITY OF MANCHESTER Database Architecture Models and Design January 2004 Answer any THREE questions Answer each question in a separate book The use of electronic calculators is not peritted.

More information

Abstract Matrix Arithmetic

Abstract Matrix Arithmetic Abstract Matrix Arithetic Alan P Sexton and Volker Sorge School of Coputer Science University of Biringha wwwcsbhaacuk/ aps vxs Stephen M Watt Coputer Science Departent University of Western Ontario wwwcsduwoca/

More information

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor

MGS-SIFT: A New Illumination Invariant Feature Based on SIFT Descriptor International Journal of Coputer Theory and Engineering, Vol 5, No, February 0 MGS-SIFT: A New Illuination Invariant Feature Based on SIFT Descriptor Reza Javanard Alitappeh and Fariborz Mahoudi Abstract

More information

Compiling an Honest but Curious Protocol

Compiling an Honest but Curious Protocol 6.876/18.46: Advanced Cryptography May 7, 003 Lecture 1: Copiling an Honest but Curious Protocol Scribed by: Jonathan Derryberry 1 Review In previous lectures, the notion of secure ultiparty coputing was

More information

Feature Selection to Relate Words and Images

Feature Selection to Relate Words and Images The Open Inforation Systes Journal, 2009, 3, 9-13 9 Feature Selection to Relate Words and Iages Wei-Chao Lin 1 and Chih-Fong Tsai*,2 Open Access 1 Departent of Coputing, Engineering and Technology, University

More information