An Interval Algebra for Indeterminate Time
|
|
- Wilfred Flynn
- 6 years ago
- Views:
Transcription
1 From AAAI- Proceedings. Copyright 2, AAAI ( All rights resered. An Interal Algebra for Indeterminate Time Wes Cowley Department of Computer Science and Engineering Uniersity of South Florida P.O. Box 213 Tampa, FL Dimitris Plexousakis Department of Computer Science Uniersity of Crete & ICS-FORTH P.O. Box 22, Heraklion Greece 7149 Abstract Temporal indeterminacy is an inherent problem which arises when capturing and manipulating temporal data in many application areas. As such, representation and manipulation of timestamps with indeterminacy is a requirement for these applications. We present an extension of Allen s thirteen interal relationships to indeterminate temporal interals based on a noel representation for indeterminate timestamps. The timestamps can be deried from and translated to interal constraints. We proide a set of simple and useful operators for manipulating both conex and non-conex indeterminate interals represented by these timestamps. Introduction Temporal indeterminacy exists when one does not know precisely either the location of an eent on the time line or its duration. The temporal knowledge about the eent is indefinite or incomplete. This is an inherent problem when reasoning in many application domains. Planning systems are sometimes faced with the infeasibility of completely modeling all aspects of a situation. Knowledge representation and reasoning systems may be faced with insufficient information to completely determine a desired time interal. The knowledge about the time interal is indeterminate one may know a period of time the interal definitely coers but there may also be a period of time into which the interal may extend. The prealent method for handling temporal indeterminacy in the temporal reasoning community is to use a temporal constraint network (TCN) on interals (Allen 193). The TCN allows the reasoner to arrie at a disjunction of possible relationships between pairs of interals. For example, Anger, et al. describe a temporal knowledge base using this approach (Anger et al. 19). The knowledge of the location and duration of an eent on the time line is encoded in the relationships between that eent and others in the network. We examine a noel representation for indeterminate interals based on the endpoints of the interals determinate and indeterminate regions and define a set of operators, which are both useful and non-complex, for manipu- Copyright cfl 2, American Association for Artificial Intelligence ( All rights resered. lating indeterminate timestamps. Conersions between interal constraints in the form of the thirteen interal relationships (Allen 193) and the indeterminate timestamps is straightforward. We use the indeterminate interals to extend the traditional interal relationships to allow for indeterminacy. To the best of our knowledge, this is the first effort in this direction. Our approach differs from TCNs in that the knowledge of an interal s position and duration is encoded in the interal s representation rather than in relationships between interal, allowing for non-complex manipulation of the knowledge. One application of this is in temporal integrity constraints for knowledge bases such as Telos (Plexousakis 1995). Another method associates characteristic functions with interals to represent the leel of possibility that any gien point is actually contained in the interal (Bouzid & Mouaddib 199). In this approach, the characteristic function of interals are modified as more knowledge is gained and schedules eole. A similar method, in the temporal database field, describes a timestamp with a probability function (Dyreson & Snodgrass 199). The probability and characteristic function approach is both more flexible and more complex than that described here as it allows for reasoning oer the likelihood that a point is in the interal or not. In our method a point is either definitely in the interal or possibly in the interal. In another approach, Gadia, et al propose a set oriented representation which supports both indeterminacy and incompleteness with a three-alued logic (Gadia, Nair, & Poon 1992). Their work is the closest to the indeterminate interals described here, but proides a different set of operators. They do not describe a method for translating between interal constraint notation and their representation, complexity of the operators, or algorithms. Our work does not examine temporally missing alues as Gadia does. Koubarakis examines indeterminacy in the context of temporal constraint databases, where temporal indeterminacy is described by local and global constraints on ariables representing the end points of the interals (Koubarakis 1994; 1997). This is similar to the interal oriented TCN approach in that knowledge of a time interal is encoded in the constraints. The purpose in this case is less oriented toward deduction and more toward finite representation of
2 potentially infinite domains. In the remainder of this paper we will first describe our assumed temporal structure and chosen representation for indeterminate interals followed by a discussion of an extension of the interal relationships to handle indeterminacy. Finally, we will gie our conclusions and aenues for future work. Valid Interal Stamps Motiation Indeterminate time may arise in a number of ways and is nearly unaoidable when dealing with the alid time of facts in a knowledge base. We are interested in associating a alid time period with facts in order to support a temporal integrity constraint implementation, such as in, e.g., (Plexousakis 1995; Cowley 1999) in which constraints include combinations of the thirteen interal relationships (Allen 193). As such, it is appropriate that the alid time periods are also specified using interal relationships. Because most of these relationships do not precisely constrain the time periods inoled, the resulting time stamps are indeterminate. Thus, we must be able to derie indeterminate alid time stamps from interal constraints, manipulate those indeterminate interals, and translate the results back to interal constraints. Points We assume a linear discrete time line (Benthem 1991) bounded by the range of the underlying integer type in which temporal points are represented. We further assume distinct elements 1, 1, andnil. With the exception of the incomparable element nil, which represents a non-specified alue, points are totally ordered by. The relationships, =, and» between two points carry the expected meaning. More formally, we assume a temporal structure T which is comprised of a set of points P = f ;p 1 ;p ;p 1 ;g and a relation. The set P = P [ f 1; 1; nilg is isomorphic to the set Z = Z [ f 1; 1; nilg. We define a one-to-one and onto mapping function, P!Z, and its inerse as follows ρ p if p = 1; 1; or nil (p) = i for p i ;i2z ρ 1 i if i = 1; 1; or nil (i) = for i 2Z p i The relation between members of the set P is defined as p 1 p 2, (p 1 ) (p 2 ) and can be extended to the special elements 1 and 1 by obsering that p 2P 1p 1. Finally, is undefined if either operand is nil. Similar translations gie the meanings for = and». Note that from the definition of, p i = p j ) i = j. The following functions permit us to determine which of a pair of points occurs earlier or later on the time line. Definition 1. We define The functions min p, max p, min p, and max p P P!P as follows min p (p 1 ;p 2 )= max p (p 1 ;p 2 )= min p (p 1 ;p 2 )= max p (p 1 ;p 2 )= nil if p 1 = nil _ p 2 = nil p 1 if p 1 p 2 p 2 otherwise nil if p 1 = nil _ p 2 = nil p 1 if p 2 p 1 p 2 otherwise nil if p 1 = nil ^ p 2 = nil p 1 if p 2 = nil _ p 1 p 2 p 2 otherwise nil if p 1 = nil ^ p 2 = nil p 1 if p 2 = nil _ p 2 p 1 otherwise p 2 min p (max p ) chooses the earliest (latest) operand if both are not nil. Where exactly one operand is nil, min p and max p return the other point. Gien a point p, we need to refer to its next and preious points on the time line. Definition 2. The functions preious and next, each with signature P!P, are defined as follows ρ p if p 2 f 1; 1; nilg preious(p) = 1 ( (p) 1) otherwise ρ p if p 2 f 1; 1; nilg next(p) = 1 ( (p) +1) otherwise Determinate Interals In order to discuss periods of time, as opposed to instants, we use interals. Definition 3. A conex interal is a set of consecutie points. An interal I can be represented by its lowest and highest points hi s ;I e i;i s» I e, I s = nil, I e = nil. We say that p 2 I iff I s» p» I e. The empty interal, which contains no point, is represented by hnil; nili or ;. Wesay that a conex interal is infinite if one or both endpoints is 1 or 1. I refers to the set of all conex interals. Points may be implicitly conerted to interals by the function interal P!I, definedasinteral(p) =hp; pi. We will use the 13 basic interal relationships (Allen 193) for comparing interals for ordering and inclusion. The concept of intersection of conex interals is important. This carries the same meaning as in set theory, namely that there is at least one point in common. Definition 4. Two conex interals I 1 and I 2 intersect if I 1s» I 2e ^ I 2s» I 1e. Note that the empty interal, hnil; nili does not intersect with any interal due to the incomparability of nil. The infinite interal, h 1; 1i intersects with all non-empty interals. We also need the concept of adjacency of conex interals, which is defined next.
3 Definition 5. We say that two interals I 1 and I 2 are adjacent if next(i 1e )=I 2s _ next(i 2e )=I 1s. We will also need the concept of non-conex interals to talk about sets of non-consecutie points. Definition 6. A non-conex interal I is a set of conex interals I i which neither intersect nor are adjacent. Indeterminate Interals A alid interal stamp (VIS) is an extension of the interal concept. A VIS describes the set of points which are definitely in the interal as well as those which may be in the interal. Through this mechanism we can represent the indeterminacy inherent in interal constraints. Definition 7. A conex alid interal stamp (CVIS) is a 4- tuple V = hi s ;D s ;D e ;I e i associated with a fact in a knowledge base. The points are restricted so that D s = nil, D e = nil and D s = nil ) (I s = nil, I e = nil). D s ;D e, if not nil, are time stamps marking the end points of the determinate interal D; that period of time during which the associated fact is true. I s and I e, if not nil,represent the extended period of time before and after the determinate interal, respectiely, during which the associated fact may be true. The indeterminate interal is the non-conex interal I = fi L ;I H g where I L and I H are ; If I s = nil I L = hvi s ;VI e i If D = ; hvi s ; preious(vd s )i otherwise ρ ; If Ie = nil _ D = ; I H = hnext(vd e );VI e i otherwise A CVIS for which both I s and I e are nil is called fully determinate, while one with both D s and D e being nil is called fully indeterminate. The empty VIS is represented as hnil; nil; nil; nili or ;. We will use CV to refer to the set of all CVISs. An interal I can be conerted implicitly to a CVIS with the function cis I!CV,definedascis(I) = hnil;i s ;I e ; nili Example 1. Figure1ashowstheCVISh1; 2; 4; 6i. This contains the points f2; 3; 4g determinately and f1; 5; 6g indeterminately. Figure 1b shows the same period coered by the fully indeterminate CVIS h1; nil; nil; 6i. Finally, Figure 1c shows the left infinite CVIS h 1; 4; 6; nili. We will often need to obtain the earliest and latest points in a CVIS independently of whether that point is determinate or not. Definition. We define the functions upper and lower as upper(v ) = max p (VD e ;VI e ) and lower(v ) = min p (VD s ;VI s ), both with signature CV! P. We will also need to know the latest point at which a CVIS V can start and the earliest point at which it can end. To understand these functions, obsere that if a CVIS V has a determinate region then the interal will start no later than (a) (b) 1 3 (c) 4 6 Figure 1 Examples of conex alid interal stamps VD s and end no earlier than VD e. On the other hand, if V is fully indeterminate then it may start as late as VI e and end as earlier as VI s. Definition 9. We define two functions, maxlo and minup, with signature CV!P as maxlo(v ) = min p (VD s ;VI e ) and minup(v ) = max p (VI s ;VD e ). The following extends the definition of membership in an interal. Definition 1. We denote membership of a point p in a CVIS V as p 2 V and define that membership as p 2 V, lower(v )» p» upper(v ). We will also use p 2 VD to represent p s determinate inclusion in V and p 2 VI to represent p s indeterminate inclusion in V. Next we extend the concept of intersection to conex alid interal stamps. Definition 11. Two CVISs, V 1 and V 2, intersect if lower(v 1 )» upper(v 2 ) ^ lower(v 2 )» upper(v 1 ).Wesay V 1 and V 2 determinately intersect if V 1 D 6= ;^V 2 D 6= ;^V 1 D intersects V 2 D. The concept of adjacency can be extended to conex alid interal stamps as follows. Definition 12. We say that two CVISs, V 1 and V 2,areadjacent if next(upper(v 1 )) = lower(v 2 )_next(upper(v 2 )) = lower(v 1 ). We say that V 1 and V 2 are determinately adjacent if V 1 D 6= ;^V 2 D 6= ;^V 1 D adjacent V 2 D. Note that two CVISs which are determinately adjacent may intersect but will not determinately intersect. The work of (Cowley 1999) depicts how to translate from interal constraints of the form R I, wherer is an interal relationship and I is a determinate interal, to a conex alid interal stamp. We will also need to consider non-conex VISs. Definition 13. A non-conex alid interal stamp (NVIS) is a finite set of CVISs which meet two conditions. 1) No two CVISs may intersect. 2) If any two CVISs are adjacent, then both must hae a definite interal and they must not be determinately adjacent. NV refers to the set of all NVISs. A CVIS can be implicitly conerted to an NVIS with the
4 function nis CV! NV, definedasnis(c) =fcg. Definition 14. V = CV [ NV is the set of all VISs. Operators on Valid Interal Stamps There are a number of operators on VISs which correspond to the similarly named ones on Boolean expressions and sets. Specifically, we will define conjunction, intersection, union, and difference of VISs below. To aoid confusion, we will annotate the usual operators to emphasize that they carry different semantics than the familiar ones. For example, we use [ for the union of VISs. When operands are known to be conex (non-conex) VISs, we will use c [ ( n [). When the familiar semantics from logic or set theory are sufficient, we will use the unannotated operators. Conjunction There are times when a single interal constraint may not adequately express the knowledge one has about a fact s alid time. For that we must conjoin multiple constraints. We will do this by way of the VIS conjunction operator 1 ^. The effect of ^ is to produce a determinate region which includes the determinate region of both operands and an indeterminate region which includes only points in the indeterminate region of both operands. The operator uses the knowledge expressed by two VISs in order to increase the accuracy to which the alid time of a fact is known. In order to compute the resulting VIS, V r, from the conjunction of two existing CVISs, V 1 and V 2,wemustfirst ensure that the conjunction is satisfiable. For example, there are no dates which satisfy the condition contains Jan-9 and during Mar-9. On the other hand, contains Jan-9 and after No-97 can be satisfied. Each operand restricts the range of the other. Definition 15. Two CVISs, V 1 and V 2,areconjunction compatible, denoted V 1 ^comp V 2,if1) V 1 intersects V 2,2) V 2 D 6= ; ) (lower(v 1 ) = V 2 D s ^ V 2 D e = upper(v 1 )), and 3) V 1 D 6= ;)(lower(v 2 ) = V 1 D s ^ V 1 D e = upper(v 2 )). We extend this definition to NVISs by saying that two NVISs are conjunction compatible if V 1i 2 V 1 9V 2j 2 V 2 such that V 1i ^comp V 2j and V 2j 2 V 2 9V 1i 2 V 1 such that V 2j ^comp V 1i. Conjunction compatibility ensures that the indefinite region of each interal encloses the definite region of the other. Otherwise, there would be a point which is in the definite region of one operand but not in the other operand at all. That is the condition which results from inconsistent interal constraints. Definition 16 ( ^). If V 1 and V 2 are VISs such that V 1^comp V 2 we define their conjunction, denoted by V 1 ^ V2,asthe 1 The term conjunction refers to the operation on interal constraints which ^ supports. It might be more appropriate to think of the effect on a VIS as strengthens. VIS V r such that V r D = fpjp 2 V 1 D _ p 2 V 2 Dg and V r I = fpjp 2 V 1 I ^ p 2 V 2 Ig. If(V 1 ^comp V 2 ) then V 1 ^ V2 = ;. Because the order of the interal constraints in a alid time specification should not matter, it is important that the order of VISs with respect to ^ not matter. Hence, this theorem, which is straightforward to show. Theorem 1. (V; ^) forms a commutatie monoid with identity ^ = h 1; nil; nil; 1i. Intersection The intersection of two CVISs is defined similarly to conjunction. The precondition is not as restrictie. It is simply necessary that the interals intersect by definition 11. On the other hand, the result of intersection is more restrictie than that of conjunction. Specifically, the determinate region produced by conjunction includes the determinate regions of both operands. If a point is determinate in only one of the operands, it is determinate in the result. For intersection, the determinate region includes only those points determinately in both operands. If a point is determinately in one operand but indeterminately in the other, the intersection contains that point indeterminately. Definition 17 ( ). We define the intersection of two VISs, V 1 and V 2, denoted by V 1 V2,astheVIS V r such that V r D = fpjp 2 V 1 D ^ p 2 V 2 Dg and V r I = fpjp 2 V 1 ^ p 2 V 2 ^ (p 2 V 1 I _ p 2 V 2 I)g. As with ^, the following is straightforward to proe. Theorem 2. (V; ) forms a commutatie monoid with identity = hnil; 1; 1; nili Union When an insert operation is performed for a fact whose non-temporal attributes are the same as an existing fact one of two things must happen. Either the operation is treated as a new insert, resulting in a pair of facts which differ only in their alid interal stamps; or the VIS of the existing fact is updated to include the alid time specified for the insert. We proide the union operator to support the latter semantics. Definition 1 ( [). We define the union of two VISs, V 1 and V 2, denoted by V 1 [ V2,astheVISV r such that V r D = fpjp 2 V 1 D _ p 2 V 2 Dg and V r I = fpjp 62 V r D ^ (p 2 V 1 I _ p 2 V 2 I)g. Again, the following is straightforward. Theorem 3. (V; [) forms a commutatie monoid with identity [ = hnil; nil; nil; nili. Difference When performing a deletion or update operation where the alid time specified for the operation is only a
5 portion of the alid time for the affected facts, we will need to produce the difference of two alid interal stamps. In general, such a difference results in a non-conex interal. Definition 19 ( ). We define the difference of two VISs, V 1 and V 2, denoted by V 1 V2 as the VIS V r such that V r D = fpjp 2 V 1 D ^ p 62 V 2 g and V r I = fpj(p 2 V 1 D ^ p 2 V 2 I) _ (p 2 V 1 I ^ p 62 V 2 D)g. Note that is neither commutatie nor associatie. The identity element, denoted by, is the empty interal. Complexity of VIS Operators The basic operators on CVISs ^comp, c^, c, c [,and c, are all constant time. This should be clear from their definitions, which depend solely on the alues of the end points. For an NVIS V, we will use jv j to indicate the number of CVISs V i 2 V. Based on an analysis of the algorithms deeloped to implement the operators, we hae the results in table 1 for NVISs. Those algorithms and proofs of these results are omitted due to lack of space. Operator Complexity ^comp O(jV 1 jjv 2 j) n ^ O(jV1 jjv 2 j) n O(jV1 jjv 2 j) n [ O((jV1 jjv 2 j) 2 ) n O(jV 2 j 4 jv 1 j) Table 1 Complexity of Operators oer NVISs Indeterminate Interal Relationships Now we turn to comparing the indeterminate interals by examining how the thirteen interal relationships used in Allen s interal algebra (Allen 193) can be extended to the indeterminate interals represented by CVISs. We will need to define both definite and potential satisfaction of the relationships when applied to CVISs, resulting in a total of 26 interal relationships. Two principles are used in reaching these definitions. Principle 1. For V 1 definitely R V 2 to hold, where R is an interal relationship, we must ;V 2 such thatv 1 ^comp V1 ^ V 2 ^comp V2 ^ ((V 1 1 )D R (V 2 2 )D) If this principle is met, it is not possible to conjoin any compatible interal constraint to either V 1 or V 2 such that R will not be satisfied. Principle 2. For V 1 potentially R V 2 to hold, where R is an interal relationship, we must hae 9V 1 ;V 2 such thatv 1 ^comp V 1 ^ V 2 ^comp V 2 ^ (V 1 1 ) definitely R (V 2 2 ) This ensures that it is possible, ia the conjunction of additional interal constraints with V 1 and V 2, to arrie at a pair of interals which definitely satisfy R. Definition 2. For two CVISs, V 1 and V 2,wesay ffl V 1 definitely equals V 2 if V 1 I = ;^V 2 I = ;^V 1 D = V 2 D ffl V 1 potentially equals V 2 if lower(v 1 )» maxlo(v 2 ) ^ lower(v 2 )» maxlo(v 1 ) ^ minup(v 2 )» upper(v 1 ) ^ minup(v 1 )» upper(v 2 ) ffl V 1 definitely before V 2 if ffl V 1 potentially before V 2 if ffl V 1 definitely meets V 2 if upper(v 1 ) lower(v 2 ) minup(v 1 ) maxlo(v 2 ) V 1 I e = nil ^ V 2 I s = nil ^ V 1 D e = V 2 D s ^ V 1 D s V 2 D s ^ V 1 D e V 2 D e ffl V 1 potentially meets V 2 if lower(v 1 ) maxlo(v 2 ) ^ minup(v 1 ) upper(v 2 ) ^ lower(v 2 )» upper(v 1 ) ^ minup(v 1 )» maxlo(v 2 ) ffl V 1 definitely oerlaps V 2 if V 1 D s lower(v 2 ) ^ upper(v 1 ) V 2 D e ^ V 2 D s V 1 D e ffl V 1 potentially oerlaps V 2 if lower(v 1 ) maxlo(v 2 ) ^ minup(v 1 ) upper(v 2 ) ^ lower(v 2 ) upper(v 1 ) ^ lower(v 1 ) preious(upper(v 1 )) ^ lower(v 2 ) preious(upper(v 2 )) ffl V 1 definitely during V 2 if V 2 D s lower(v 1 ) ^ upper(v 1 ) V 2 D e ffl V 1 potentially during V 2 if lower(v 2 ) maxlo(v 1 ) ^ minup(v 1 ) upper(v 2 ) ^ lower(v 2 ) preious(upper(v 2 )) ffl V 1 definitely starts V 2 if V 1 I s = nil ^ V 2 I s = nil ^ V 1 D s = V 2 D s ^ upper(v 1 ) minup(v 2 ) ffl V 1 potentially starts V 2 if lower(v 1 )» maxlo(v 2 ) ^ lower(v 2 )» maxlo(v 1 ) ^ minup(v 1 ) upper(v 2 ) ffl V 1 definitely finishes V 2 if V 1 I e = nil ^ V 2 I e = nil ^ V 1 D e = V 2 D e ^ V 2 D s lower(v 1 )
6 ffl V 1 potentially finishes V 2 if minup(v 2 )» upper(v 1 ) ^ minup(v 1 )» upper(v 2 ) ^ lower(v 2 ) maxlo(v 1 ) We can make some interesting obserations about the compatibility of the arious interal relationships. First, we note that the interal relationships between determinate interals are mutually exclusie. Lemma 1. Let I 1, I 2 be interals and R 1, R 2 be determinate interal relationships. Then, I 1 R 1 I 2 )(I 1 R 2 I 2 ). Proof. This follows directly from the definitions of the relationships. This obseration extends to the definite relationships between alid interal stamps. Theorem 4. Let V 1 and V 2 be alid interal stamps and let R 1 and R 2 be determinate interal relationships, R 1 6= R 2. Then, V 1 definitely R 1 V 2 )(V 1 definitely R 2 V 2 ). Proof. Assume that V 1 definitely R 1 V 2. Then 9V1 ;V 2 such that (V 1 1 )D R 1 (V 2 2 )D. By lemma 1, we know that ((V 1 1 )D R 2 (V 2 2 )D). Principle 1 then requires that (V 1 definitely R 2 V 2 ). We cannot make the same conclusion regarding potential relationships, howeer. Theorem 5. Let V 1 and V 2 be alid interal stamps and let R 1 and R 2 be determinate interal relationships, R 1 6= R 2. Then, V 1 potentially R 1 V 2 6) (V 1 potentially R 2 V 2 ). Proof. By example Let p 1 and p 2 be points, p 1 p 2. Let V 1 = V 2 = hp 1 ; nil; nil;p 2 i. Choose V1 = V 2 = hnil;p 1 ;p 2 ; nili. Then, (V 1 1 )D equals (V 2 2 )D. By principle 2 V 1 potentially equals V 2. Now, choose V1 = hnil;p 1 ;p 1 ; nili and V2 = hnil;p 2 ;p 2 ; nili. So, (V 1 1 )D before (V 2 V 1 potentially before V 2. 2 )D and Finally, we can see that, as expected, a definite relationship implies a potential one. Theorem 6. Let V 1 and V 2 be alid interal stamps and let R be a determinate interal relationship. Then, V 1 definitely R V 2 ) V 1 potentially R V 2. Proof. Assume V 1 definitely R V 2. Choose V 1 = V 2 = ^. Then V 1 1 = V 1 and V 2 2 = V 2, so (V 1 1 ) definitely R (V 2 2 ). This meets the conditions for principle 2. Therefore, V 1 potentially R V 2. Conclusions and Future Work We hae shown a representation for both conex and nonconex indeterminate interals and proided a useful set of operators on those interals. Further, we hae shown that it is possible to extend the relationships used in Allen s interal algebra (Allen 193) to the indeterminate interals represented by conex alid interal stamps. These extensions are interesting in their own right because of the large amount of prior work in both the artificial intelligence and database fields that is based on the interal algebra and its ariants. One specific application area is in allowing temporal integrity constraints to take into account indeterminism. An obious extension of this current work would be to reformulate Allen s constraint propagation algorithms to use indeterminate interals and inestigate resulting differences in complexity and reasoning power. It would also be interesting to reformulate the potential and definite relationships presented here using interals treated as primitie constructs instead of based on end points. For determinate interals, all thirteen relationships can be defined in terms of either meets or before. This would proide the ability to use dense or continuous timelines as well as discrete. Acknowledgements The authors would like to thank Dr. Manolis Koubarakis and the anonymous referees for their comments. References Allen, J. F Maintaining knowledge about temporal interals. Communications of the ACM 26(11) Anger, F. D.; Mata-Toledo, R. A.; Morris, R. A.; and Rodriguez, R. V. 19. A relational knowledge base with temporal reasoning. In Proceedings of the First Florida Artificial Intelligence Research Symposium, Benthem, J The Logic of Time. Dordrecht, Holland Kluwer Academic Publishers. Bouzid, M., and Mouaddib, A.-I Uncertain temporal reasoning for the distributed transportation scheduling problem. In Proceedings Fifth International Workshop on Temporal Representation and Reasoning, Cowley, W Temporal integrity constraints with temporal indeterminacy. Master s thesis, Uniersity of South Florida. Dyreson, C. E., and Snodgrass, R. T Supporting alid-time indeterminacy. Transactions on Database Systems 23(1)1 57. Gadia, S. K.; Nair, S. S.; and Poon, Y.-C Incomplete information in relational temporal databases. In Proceedings of the 1th International Conference on Very Large Data Bases, Koubarakis, M Database models for infinite and indefinite temporal information. Information Systems 19(2) Koubarakis, M The complexity of query ealuation in indefinite temporal constraint databases. Theoretical Computer Science 171(1 2)25 6. Plexousakis, D Compilation and simplification of temporal integrity constraints. In Rules in Database Systems Second International Workshop,
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
From: AAAI-00 Proceedings Copyright 2000, AAAI (wwwaaaiorg) All rights reserved Disjunctive Temporal Reasoning in Partially Ordered Models of Time Mathias Broxvall and Peter Jonsson Department of Computer
More informationRoberto s Notes on Linear Algebra Chapter 1: Geometric vectors Section 8. The dot product
Roberto s Notes on Linear Algebra Chapter 1: Geometric ectors Section 8 The dot product What you need to know already: What a linear combination of ectors is. What you can learn here: How to use two ectors
More informationLECTURE 2: CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS
LECTURE : CROSS PRODUCTS, MULTILINEARITY, AND AREAS OF PARALLELOGRAMS MA1111: LINEAR ALGEBRA I, MICHAELMAS 016 1. Finishing up dot products Last time we stated the following theorem, for which I owe you
More informationInteger Parameter Synthesis for Real-time Systems
1 Integer Parameter Synthesis for Real-time Systems Aleksandra Joanoić, Didier Lime and Oliier H. Roux École Centrale de Nantes - IRCCyN UMR CNRS 6597 Nantes, France Abstract We proide a subclass of parametric
More informationA Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space
From: FLAIRS- Proceedings. Copyright AAAI (www.aaai.org). All rights reserved. A Class of Star-Algebras for Point-Based Qualitative Reasoning in Two- Dimensional Space Debasis Mitra Department of Computer
More informationA new Framework for the Analysis of Simultaneous Events
A new ramework for the Analysis of Simultaneous ents Christoph Barz Rolf Göpffarth Peter Martini Andre Wenzel Uniersity of Bonn Institute of Computer Science IV Roemerstr. 164 D-53117 Bonn Germany {barzrggmartiniwenzel}@cs.uni-bonn.de
More informationFREEWAY WEAVING. Highway Capacity Manual 2000 CHAPTER 24 CONTENTS EXHIBITS
CHAPTER 24 FREEWAY WEAVING CONTENTS I. INTRODUCTION... 24-1 Scope of the Methodology...24-1 Limitations of the Methodology...24-1 II. METHODOLOGY...24-1 LOS...24-2 Weaing Segment Parameters...24-3 Determining
More informationAETHER THEORY AND THE PRINCIPLE OF RELATIVITY 1
AEHER HEORY AND HE PRINIPLE OF RELAIVIY 1 Joseph Ley 4 Square Anatole France, 915 St Germain-lès-orbeil, France E. Mail: ley.joseph@orange.fr 14 Pages, 1 figure, Subj-lass General physics ABSRA his paper
More informationA matrix Method for Interval Hermite Curve Segmentation O. Ismail, Senior Member, IEEE
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:15 No:03 7 A matrix Method for Interal Hermite Cure Segmentation O. Ismail, Senior Member, IEEE Abstract Since the use
More informationThe Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost
The Budgeted Minimum Cost Flow Problem with Unit Upgrading Cost Christina Büsing Sarah Kirchner Arie Koster Annika Thome October 6, 2015 Abstract The budgeted minimum cost flow problem (BMCF(K)) with unit
More informationVISUAL PHYSICS ONLINE RECTLINEAR MOTION: UNIFORM ACCELERATION
VISUAL PHYSICS ONLINE RECTLINEAR MOTION: UNIFORM ACCELERATION Predict Obsere Explain Exercise 1 Take an A4 sheet of paper and a heay object (cricket ball, basketball, brick, book, etc). Predict what will
More informationare applied to ensure that physical principles are not iolated in the definition of the discrete transition model. The oerall goal is to use this fram
A Comprehensie Methodology for Building Hybrid Models of Physical Systems Pieter J. Mosterman Λ Institute of Robotics and System Dynamics DLR Oberpfaffenhofen P.O. Box 1116 D-8223 Wessling Germany Gautam
More informationBounding the Effectiveness of Temporal Redundancy in Fault-tolerant Real-time Scheduling under Error Bursts
Bounding the Effectieness of Temporal Redundancy in Fault-tolerant Real-time Scheduling under Error Bursts Abhilash Thekkilakattil, Radu Dobrin, Sasikumar Punnekkat Mälardalen Real-Time Research Center,
More informationReversal in time order of interactive events: Collision of inclined rods
Reersal in time order of interactie eents: Collision of inclined rods Published in The European Journal of Physics Eur. J. Phys. 27 819-824 http://www.iop.org/ej/abstract/0143-0807/27/4/013 Chandru Iyer
More informationSEARCH FOR INTERMEDIATE VECTOR BOSONS AND OTHER PROCESSES USING HIGH-ENERGY NEUTRINOS AND FE-MAGNET SPARK CHAMBERS
-1 - SS-123 2026 SEARCH FOR INTERMEDIATE VECTOR BOSONS AND OTHER PROCESSES USING HIGH-ENERGY NEUTRINOS AND FE-MAGNET SPARK CHAMBERS S1uar1 L. Meyer Nor1hwestern Uniersity ABSTRACT e hae extended preious
More informationTowards Green Distributed Storage Systems
Towards Green Distributed Storage Systems Abdelrahman M. Ibrahim, Ahmed A. Zewail, and Aylin Yener Wireless Communications and Networking Laboratory (WCAN) Electrical Engineering Department The Pennsylania
More informationPatterns of Non-Simple Continued Fractions
Patterns of Non-Simple Continued Fractions Jesse Schmieg A final report written for the Uniersity of Minnesota Undergraduate Research Opportunities Program Adisor: Professor John Greene March 01 Contents
More informationScalar multiplication and algebraic direction of a vector
Roberto s Notes on Linear Algebra Chapter 1: Geometric ectors Section 5 Scalar multiplication and algebraic direction of a ector What you need to know already: of a geometric ectors. Length and geometric
More informationUNDERSTAND MOTION IN ONE AND TWO DIMENSIONS
SUBAREA I. COMPETENCY 1.0 UNDERSTAND MOTION IN ONE AND TWO DIMENSIONS MECHANICS Skill 1.1 Calculating displacement, aerage elocity, instantaneous elocity, and acceleration in a gien frame of reference
More informationTrichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs Mirosław Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA Abstract. We present
More informationRevising General Knowledge Bases in Description Logics
Revising General Knowledge Bases in Description Logics Zhe Wang and Kewen Wang and Rodney Topor Griffith University, Australia Abstract Revising knowledge bases (KBs) in description logics (DLs) in a syntax-independent
More informationEstimation of Efficiency with the Stochastic Frontier Cost. Function and Heteroscedasticity: A Monte Carlo Study
Estimation of Efficiency ith the Stochastic Frontier Cost Function and Heteroscedasticity: A Monte Carlo Study By Taeyoon Kim Graduate Student Oklahoma State Uniersity Department of Agricultural Economics
More informationChromatic characterization of biclique cover. Denis Cornaz. Jean Fonlupt. Equipe Combinatoire, UFR 921, Universite Pierre et Marie Curie, 4 place
Chromatic characterization of biclique coer Denis Cornaz France Telecom R&D, 38-40 rue du General Leclerc, Issy-les-Moulineaux 92794 Jean Fonlupt Equipe Combinatoire, UFR 921, Uniersite Pierre et Marie
More informationAstrometric Errors Correlated Strongly Across Multiple SIRTF Images
Astrometric Errors Correlated Strongly Across Multiple SIRTF Images John Fowler 28 March 23 The possibility exists that after pointing transfer has been performed for each BCD (i.e. a calibrated image
More informationOptimization Problems in Multiple Subtree Graphs
Optimization Problems in Multiple Subtree Graphs Danny Hermelin Dror Rawitz February 28, 2010 Abstract We study arious optimization problems in t-subtree graphs, the intersection graphs of t- subtrees,
More informationChapter 1. The Postulates of the Special Theory of Relativity
Chapter 1 The Postulates of the Special Theory of Relatiity Imagine a railroad station with six tracks (Fig. 1.1): On track 1a a train has stopped, the train on track 1b is going to the east at a elocity
More informationReasoning with Cardinal Directions: An Efficient Algorithm
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Reasoning with Cardinal Directions: An Efficient Algorithm Xiaotong Zhang and Weiming Liu and Sanjiang Li and Mingsheng
More informationChapter 4: Techniques of Circuit Analysis
Chapter 4: Techniques of Circuit Analysis This chapter gies us many useful tools for soling and simplifying circuits. We saw a few simple tools in the last chapter (reduction of circuits ia series and
More informationSolving Dynamic Controllability Problem of Multi-Agent Plans with Uncertainty Using Mixed Integer Linear Programming
930 ECAI 016 G.A. Kaminka et al. (Eds.) 016 The Authors and IOS Press. This article is published online with Open Access by IOS Press and distributed under the terms of the Creatie Commons Attribution
More informationBrake applications and the remaining velocity Hans Humenberger University of Vienna, Faculty of mathematics
Hans Humenberger: rake applications and the remaining elocity 67 rake applications and the remaining elocity Hans Humenberger Uniersity of Vienna, Faculty of mathematics Abstract It is ery common when
More informationIn: 5th Int. Symp. on Advances in Spatial Databases (SSD 97), LNCS 1262, Vague Regions. Martin Erwig & Markus Schneider
In: 5th Int. Symp. on Adances in Spatial Databases (SSD 97), LNCS 1262, 298-320 Vague Regions Martin Erwig & Markus Schneider FernUniersität Hagen Praktische Informatik IV D-58084 Hagen, Germany [martin.erwig
More informationReview of Matrices and Vectors 1/45
Reiew of Matrices and Vectors /45 /45 Definition of Vector: A collection of comple or real numbers, generally put in a column [ ] T "! Transpose + + + b a b a b b a a " " " b a b a Definition of Vector
More informationDynamic Vehicle Routing with Moving Demands Part II: High speed demands or low arrival rates
ACC 9, Submitted St. Louis, MO Dynamic Vehicle Routing with Moing Demands Part II: High speed demands or low arrial rates Stephen L. Smith Shaunak D. Bopardikar Francesco Bullo João P. Hespanha Abstract
More informationALGEBRAIC TOPOLOGY IV. Definition 1.1. Let A, B be abelian groups. The set of homomorphisms ϕ: A B is denoted by
ALGEBRAIC TOPOLOGY IV DIRK SCHÜTZ 1. Cochain complexes and singular cohomology Definition 1.1. Let A, B be abelian groups. The set of homomorphisms ϕ: A B is denoted by Hom(A, B) = {ϕ: A B ϕ homomorphism}
More informationOn reachability under uncertainty. A.B.Kurzhanski. Moscow State University. P.Varaiya. University of California at Berkeley
On reachability under uncertainty A.B.Kurzhanski Moscow State Uniersity P.Varaiya Uniersity of California at Berkeley Abstract. The paper studies the problem of reachability for linear systems in the presence
More informationLöwenheim-Skolem Theorems, Countable Approximations, and L ω. David W. Kueker (Lecture Notes, Fall 2007)
Löwenheim-Skolem Theorems, Countable Approximations, and L ω 0. Introduction David W. Kueker (Lecture Notes, Fall 2007) In its simplest form the Löwenheim-Skolem Theorem for L ω1 ω states that if σ L ω1
More informationBc. Dominik Lachman. Bruhat-Tits buildings
MASTER THESIS Bc. Dominik Lachman Bruhat-Tits buildings Department of Algebra Superisor of the master thesis: Study programme: Study branch: Mgr. Vítězsla Kala, Ph.D. Mathematics Mathematical structure
More informationOntologies and Domain Theories
Ontologies and Domain Theories Michael Grüninger Department of Mechanical and Industrial Engineering University of Toronto gruninger@mie.utoronto.ca Abstract Although there is consensus that a formal ontology
More informationFUZZY FINITE ELEMENT METHOD AND ITS APPLICATION
TRENDS IN COMPUTATIONAL STRUCTURAL MECHANICS W.A. Wall, K.U. Bletzinger and K. Schweizerhof (Eds.) CIMNE, Barcelona, Spain 2001 FUZZY FINITE ELEMENT METHOD AND ITS APPLICATION B. Möller*, M. Beer, W. Graf
More informationRevision of DL-Lite Knowledge Bases
Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs).
More informationIncomplete Information in RDF
Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens
More informationDynamic Vehicle Routing with Heterogeneous Demands
Dynamic Vehicle Routing with Heterogeneous Demands Stephen L. Smith Marco Paone Francesco Bullo Emilio Frazzoli Abstract In this paper we study a ariation of the Dynamic Traeling Repairperson Problem DTRP
More informationResidual migration in VTI media using anisotropy continuation
Stanford Exploration Project, Report SERGEY, Noember 9, 2000, pages 671?? Residual migration in VTI media using anisotropy continuation Tariq Alkhalifah Sergey Fomel 1 ABSTRACT We introduce anisotropy
More informationA-level Mathematics. MM03 Mark scheme June Version 1.0: Final
-leel Mathematics MM0 Mark scheme 660 June 0 Version.0: Final Mark schemes are prepared by the Lead ssessment Writer and considered, together with the releant questions, by a panel of subject teachers.
More informationInelastic Collapse in One Dimensional Systems with Ordered Collisions
Lake Forest College Lake Forest College Publications Senior Theses Student Publications 4-4-05 Inelastic Collapse in One Dimensional Systems with Ordered Collisions Brandon R. Bauerly Lake Forest College,
More informationKratzer on Modality in Natural Language
Kratzer on Modality in Natural Language 1 Modal Logic General Propositional modal logic: Syntax: 02.06.12 William Starr Phil 6710 / Ling 6634 Spring 2012 Atomic formulas: P, Q, R,..., Connecties:,,,,,,
More informationA New Approach to Knowledge Base Revision in DL-Lite
A New Approach to Knowledge Base Revision in DL-Lite Zhe Wang and Kewen Wang and Rodney Topor School of ICT, Griffith University Nathan, QLD 4111, Australia Abstract Revising knowledge bases (KBs) in description
More informationNested Epistemic Logic Programs
Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and
More informationarxiv: v2 [math.co] 12 Jul 2009
A Proof of the Molecular Conjecture Naoki Katoh and Shin-ichi Tanigawa arxi:0902.02362 [math.co] 12 Jul 2009 Department of Architecture and Architectural Engineering, Kyoto Uniersity, Kyoto Daigaku Katsura,
More informationA Quadratic Propagator for the Inter-Distance Constraint
A Quadratic Propagator for the Inter-Distance Constraint Claude-Guy Quimper University of Waterloo School of Computer Science cquimper@uwaterloo.ca Alejandro López-Ortiz University of Waterloo School of
More informationLINEAR ALGEBRA. and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition
LINEAR ALGEBRA and VECTOR GEOMETRY Volume 2 of 2 September 2014 edition Because the book is so large, the entire Linear Algebra course has been split into two olumes. Grant Skene for Grant s Tutoring (www.grantstutoring.com)
More informationPairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events Massimo Franceschet Angelo Montanari Dipartimento di Matematica e Informatica, Università di Udine Via delle
More informationRelativistic Energy Derivation
Relatiistic Energy Deriation Flamenco Chuck Keyser //4 ass Deriation (The ass Creation Equation ρ, ρ as the initial condition, C the mass creation rate, T the time, ρ a density. Let V be a second mass
More informationTHE FIFTH DIMENSION EQUATIONS
JP Journal of Mathematical Sciences Volume 7 Issues 1 & 013 Pages 41-46 013 Ishaan Publishing House This paper is aailable online at http://www.iphsci.com THE FIFTH DIMENSION EQUATIONS Niittytie 1B16 03100
More informationSection 6: PRISMATIC BEAMS. Beam Theory
Beam Theory There are two types of beam theory aailable to craft beam element formulations from. They are Bernoulli-Euler beam theory Timoshenko beam theory One learns the details of Bernoulli-Euler beam
More informationTwo-Valued Logic Programs
Two-Valued Logic Programs Vladimir Lifschitz University of Texas at Austin, USA Abstract We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning
More informationLESSON 4: INTEGRATION BY PARTS (I) MATH FALL 2018
LESSON 4: INTEGRATION BY PARTS (I) MATH 6 FALL 8 ELLEN WELD. Integration by Parts We introduce another method for ealuating integrals called integration by parts. The key is the following : () u d = u
More informationTopological Growth Rates and Fractal Dimensions
Chapter 5 Topological Growth Rates and Fractal Dimensions 5.1 Introduction Throughout this thesis, we obsere close correlations between alues of the topological growth rates and arious other fractal indices.
More informationInformation Propagation Speed in Bidirectional Vehicular Delay Tolerant Networks
Information Propagation Speed in Bidirectional Vehicular Delay Tolerant Networks Emmanuel Baccelli, Philippe Jacquet, Bernard Mans, Georgios Rodolakis INRIA, France, {firstname.lastname}@inria.fr Macquarie
More informationArtificial Intelligence
Artificial Intelligence Propositional Logic [1] Boolean algebras by examples U X U U = {a} U = {a, b} U = {a, b, c} {a} {b} {a, b} {a, c} {b, c}... {a} {b} {c} {a, b} {a} The arrows represents proper inclusion
More informationTowards Universal Cover Decoding
International Symposium on Information Theory and its Applications, ISITA2008 Auckland, New Zealand, 7-10, December, 2008 Towards Uniersal Coer Decoding Nathan Axig, Deanna Dreher, Katherine Morrison,
More informationAnnotated revision programs
Annotated revision programs Victor Marek Inna Pivkina Miros law Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046 marek inna mirek@cs.engr.uky.edu Abstract Revision
More informationA Geometric Review of Linear Algebra
A Geometric Reiew of Linear Algebra The following is a compact reiew of the primary concepts of linear algebra. The order of presentation is unconentional, with emphasis on geometric intuition rather than
More informationFuzzy Propositional Logic for the Knowledge Representation
Fuzzy Propositional Logic for the Knowledge Representation Alexander Savinov Institute of Mathematics Academy of Sciences Academiei 5 277028 Kishinev Moldova (CIS) Phone: (373+2) 73-81-30 EMAIL: 23LSII@MATH.MOLDOVA.SU
More information6. Logical Inference
Artificial Intelligence 6. Logical Inference Prof. Bojana Dalbelo Bašić Assoc. Prof. Jan Šnajder University of Zagreb Faculty of Electrical Engineering and Computing Academic Year 2016/2017 Creative Commons
More informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The
More informationAsymptotic Normality of an Entropy Estimator with Exponentially Decaying Bias
Asymptotic Normality of an Entropy Estimator with Exponentially Decaying Bias Zhiyi Zhang Department of Mathematics and Statistics Uniersity of North Carolina at Charlotte Charlotte, NC 28223 Abstract
More informationExpiration of Historical Databases
Expiration of Historical Databases (Extended Abstract) David Toman Department of Computer Science, University of Waterloo Waterloo, Ontario, Canada N2L 3G1 E-mail: david@uwaterloo.ca Abstract We present
More informationState-space Modelling of Hysteresis-based Control Schemes
European Control Conference (ECC) July 7-9,, Zürich, Switzerland. State-space Modelling of Hysteresis-based Control Schemes Soumya Kundu Ian A. Hiskens Abstract The paper deelops a state-space model for
More informationDynamics ( 동역학 ) Ch.2 Motion of Translating Bodies (2.1 & 2.2)
Dynamics ( 동역학 ) Ch. Motion of Translating Bodies (. &.) Motion of Translating Bodies This chapter is usually referred to as Kinematics of Particles. Particles: In dynamics, a particle is a body without
More informationMagnetic Fields Part 3: Electromagnetic Induction
Magnetic Fields Part 3: Electromagnetic Induction Last modified: 15/12/2017 Contents Links Electromagnetic Induction Induced EMF Induced Current Induction & Magnetic Flux Magnetic Flux Change in Flux Faraday
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationInsights into Cross-validation
Noname manuscript No. (will be inserted by the editor) Insights into Cross-alidation Amit Dhurandhar Alin Dobra Receied: date / Accepted: date Abstract Cross-alidation is one of the most widely used techniques,
More informationG 2(X) X SOLVABILITY OF GRAPH INEQUALITIES. 1. A simple graph inequality. Consider the diagram in Figure 1.
SOLVABILITY OF GRAPH INEQUALITIES MARCUS SCHAEFER AND DANIEL ŠTEFANKOVIČ Abstract. We inestigate a new type of graph inequality (in the tradition of Cetkoić and Simić [Contributions to Graph Theory and
More informationFrom Crisp to Fuzzy Constraint Networks
From Crisp to Fuzzy Constraint Networks Massimiliano Giacomin Università di Brescia Dipartimento di Elettronica per l Automazione Via Branze 38, I-25123 Brescia, Italy giacomin@ing.unibs.it Abstract. Several
More informationSUPPLEMENTARY MATERIAL. Authors: Alan A. Stocker (1) and Eero P. Simoncelli (2)
SUPPLEMENTARY MATERIAL Authors: Alan A. Stocker () and Eero P. Simoncelli () Affiliations: () Dept. of Psychology, Uniersity of Pennsylania 34 Walnut Street 33C Philadelphia, PA 94-68 U.S.A. () Howard
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Deductive Inference for the Interiors and Exteriors of Horn Theories
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Deductive Inference for the Interiors and Exteriors of Horn Theories Kazuhisa MAKINO and Hirotaka ONO METR 2007 06 February 2007 DEPARTMENT OF MATHEMATICAL INFORMATICS
More informationRelativity in Classical Mechanics: Momentum, Energy and the Third Law
Relatiity in Classical Mechanics: Momentum, Energy and the Third Law Roberto Assumpção, PUC-Minas, Poços de Caldas- MG 37701-355, Brasil assumpcao@pucpcaldas.br Abstract Most of the logical objections
More informationThe Geometry and Topology of Groups
The Geometry and Topology of Groups Brent Eeritt ersion March 3, 2005 Contents 1. Clockwork topology. 2. From 2-complexes to groups. 3. From 2-complexes to groups: more adanced features. 4. Presentations.
More informationMinimal error certificates for detection of faulty sensors using convex optimization
Forty-Seenth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 30 - October 2, 2009 Minimal error certificates for detection of faulty sensors using conex optimization Christian
More informationDynamic Lot Size Problems with One-way Product Substitution 1
This is the Pre-Published Version. 03/2002/100057 ynamic Lot Size Problems with One-way Product Substitution 1 Vernon Ning Hsu School of Management George Mason Uniersity Fairfax, VA 22030, USA email hsu@gmu.edu
More informationVerification of Time Ontologies with Points and Intervals
Verification of Time Ontologies with Points and Intervals Michael Grüninger Darren Ong Department of Mechanical and Industrial Engineering University of Toronto Toronto, Ontario, Canada M5S 3G8 Abstract
More informationComputing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES
Computing Laboratory A GAME-BASED ABSTRACTION-REFINEMENT FRAMEWORK FOR MARKOV DECISION PROCESSES Mark Kattenbelt Marta Kwiatkowska Gethin Norman Daid Parker CL-RR-08-06 Oxford Uniersity Computing Laboratory
More informationPolynomial-Solvability of N P-class Problems
Polynomial-Solability of N P-class Problems Anatoly Panyuko paniukoa@susu.ru arxi:1409.03755 [cs.cc] 24 Aug 2018 Abstract LetHamiltoniancomplement ofthegraphg = (V(G), E(G))betheminimal cardinality set
More informationThe Inverse Function Theorem
Inerse Function Theorem April, 3 The Inerse Function Theorem Suppose and Y are Banach spaces and f : Y is C (continuousl differentiable) Under what circumstances does a (local) inerse f exist? In the simplest
More informationEnhancing the Updatability of Projective Views
Enhancing the Updatability of Projective Views (Extended Abstract) Paolo Guagliardo 1, Reinhard Pichler 2, and Emanuel Sallinger 2 1 KRDB Research Centre, Free University of Bozen-Bolzano 2 Vienna University
More informationMotors and Generators
Physics Motors and Generators New Reised Edition Brian Shadwick Contents Use the table of contents to record your progress through this book. As you complete each topic, write the date completed, then
More informationMethods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains
Methods of Partial Logic for Knowledge Representation and Deductive Reasoning in Incompletely Specified Domains Anatoly Prihozhy and Liudmila Prihozhaya Information Technologies and Robotics Department,
More informationBAYESIAN PREMIUM AND ASYMPTOTIC APPROXIMATION FOR A CLASS OF LOSS FUNCTIONS
TH USHNG HOUS ROCDNGS OF TH ROMANAN ACADMY Series A OF TH ROMANAN ACADMY Volume 6 Number 3/005 pp 000-000 AYSAN RMUM AND ASYMTOTC AROMATON FOR A CASS OF OSS FUNCTONS Roxana CUMARA Department of Mathematics
More informationAn Explicit Lower Bound of 5n o(n) for Boolean Circuits
An Eplicit Lower Bound of 5n o(n) for Boolean Circuits Kazuo Iwama, Oded Lachish, Hiroki Morizumi, and Ran Raz Graduate School of Informatics, Kyoto Uniersity, Kyoto, JAPAN {iwama, morizumi}@kuis.kyoto-u.ac.jp
More informationSELECTION, SIZING, AND OPERATION OF CONTROL VALVES FOR GASES AND LIQUIDS Class # 6110
SELECTION, SIZIN, AND OERATION OF CONTROL VALVES FOR ASES AND LIUIDS Class # 6110 Ross Turbiille Sales Engineer Fisher Controls International Inc. 301 S. First Aenue Marshalltown, Iowa USA Introduction
More informationTools for Investigation of Dynamics of DC-DC Converters within Matlab/Simulink
Tools for Inestigation of Dynamics of DD onerters within Matlab/Simulink Riga Technical Uniersity, Riga, Latia Email: pikulin03@inbox.l Dmitry Pikulin Abstract: In this paper the study of complex phenomenon
More informationBreaking de Morgan s law in counterfactual antecedents
Breaking de Morgan s law in counterfactual antecedents Lucas Champollion New York University champollion@nyu.edu Ivano Ciardelli University of Amsterdam i.a.ciardelli@uva.nl Linmin Zhang New York University
More informationOPTIMAL RESOLVABLE DESIGNS WITH MINIMUM PV ABERRATION
Statistica Sinica 0 (010), 715-73 OPTIMAL RESOLVABLE DESIGNS WITH MINIMUM PV ABERRATION J. P. Morgan Virginia Tech Abstract: Amongst resolable incomplete block designs, affine resolable designs are optimal
More informationDynamic Vehicle Routing with Moving Demands Part II: High speed demands or low arrival rates
Dynamic Vehicle Routing with Moing Demands Part II: High speed demands or low arrial rates Stephen L. Smith Shaunak D. Bopardikar Francesco Bullo João P. Hespanha Abstract In the companion paper we introduced
More informationDynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
1 Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies Shaunak D. Bopardikar Stephen L. Smith Francesco Bullo João P. Hespanha Abstract We introduce a problem
More informationInterleaved Alldifferent Constraints: CSP vs. SAT Approaches
Interleaved Alldifferent Constraints: CSP vs. SAT Approaches Frédéric Lardeux 3, Eric Monfroy 1,2, and Frédéric Saubion 3 1 Universidad Técnica Federico Santa María, Valparaíso, Chile 2 LINA, Université
More informationOnline Companion to Pricing Services Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions?
Online Companion to Pricing Serices Subject to Congestion: Charge Per-Use Fees or Sell Subscriptions? Gérard P. Cachon Pnina Feldman Operations and Information Management, The Wharton School, Uniersity
More informationAccuracy Bounds for Belief Propagation
Appeared at Uncertainty in Artificial Intelligence, July 2007. Some typos corrected. Accuracy Bounds for Belief Propagation Alexander T. Ihler Toyota Technological Institute, Chicago 427 East 60 th St.,
More informationThe Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019
The Riemann-Roch Theorem: a Proof, an Extension, and an Application MATH 780, Spring 2019 This handout continues the notational conentions of the preious one on the Riemann-Roch Theorem, with one slight
More information