Periodicity-based Temporal Constraints Paolo Terenziani*,

Size: px
Start display at page:

Download "Periodicity-based Temporal Constraints Paolo Terenziani*,"

Transcription

1 Periodicity-based Temporal Constraints Paolo Terenziani*, Luca Anselma, Stefania Montani* *{terenz DI, Univ.. del Piemonte Orientale A. Avogadro, Italy DI, Università di Torino, Italy

2 Outline Introduction Representation formalism Reasoning mechanisms Conclusions 2

3 Outline Introduction Representation formalism Reasoning mechanisms Conclusions 3

4 Introduction Periodic events are widely studied in many research areas, such as Artificial Intelligence (AI) and Temporal Databases (TDB). In AI, approaches on periodicity-based temporal constraints: qualitative constraints [Terenziani,, 97] or durations [Longanantharaj & Gimbrone,, 95] between periodic events depend on the specific periodicity in which such events occur. In TDB, several approaches to model user-defined periodicities [Tuzhilin&Clifford Tuzhilin&Clifford,, 95].

5 Introduction Goals Comprehensive framework: - user-defined periodicities; - periodicity-based temporal constraints; - qualitative [Allen, 83] + quantitative [Dechter et al., 91] temporal constraints. 5

6 Outline Introduction Representation formalism Reasoning mechanisms Conclusions 6

7 Representation Formalism Periodicity-based constraint: <Ev, Per, Constr> Ev: : pair of events Per: : user-defined periodicity Constr: : temporal constraints 7

8 Representation Formalism Intuitive semantics <<ev1, ev2>, P, C> For each occurrence p i of P : 1. exactly one instance e1 i of ev1 in p i ; 2. exactly one instance e2 i of ev2 in p i ; 3. C(e1 i, e2 i ) holds. p 1 C p 2 C p 3 C e1 1 e2 1 e1 2 e2 2 e1 3 e2 3 time 8

9 Representation Formalism Regarding periodicities and constraints, we rely on contributions in literature: - periodicities: Leban et al. s collection formalism [86]; - temporal constraints: Dechter et al. s STP [91]. 9

10 Representation Formalism Examples Leban et al. collection formalism: Monday is the first day of the week Mondays := [1] \ Days:during:Weeks 10

11 Representation Formalism Examples Leban et al. collection formalism: Monday is the first day of the week Mondays := [1] \ Days:during:Weeks Dechter et al. s STP: Tom finishes to work between 10 and 30 min after Mary 10m E TW E MW 30m Tom starts to work after Mary 0 < S TW S MW < + 11

12 Representation Formalism Examples Periodicity-based constraint: On Monday, Tom starts to work after Mary, and finishes between 10 and 30 min after her <<TW, MW>, Mondays, <(0,+ ),(10m,+ ), (-,+ ),[10m,30m]>> (<<ev1,ev2>, P, <S ev1,s ev2 >,<S ev1,e ev2 >, <E ev1,s ev2 >,<E ev1,e ev2 >>) 12

13 Outline Introduction Representation formalism Reasoning mechanisms Conclusions 13

14 Constraint-propagation propagation-based temporal reasoning based on intersection <<ev1, ev2>, P 1, C 1 > <<ev1, ev2>, P 2, C 2 > <<ev1, ev2>,?,?>; and composition and composition <<ev1, ev2>, P 1, C 1 <<ev2, ev3>, P 2, C 2 > <<ev1, ev3>,?,?>. 14

15 Extensional calculus: exploding periodicities and generating all the instances of events (repetitions). 15

16 Extensional calculus: exploding periodicities and generating all the instances of events (repetitions). Two main drawbacks: - Too many instances; - Output of constraint propagation not user- friendly and perspicuous. 16

17 Extensional calculus: exploding periodicities and generating all the instances of events (repetitions). Two main drawbacks: - Too many instances; - Output of constraint propagation not user- friendly and perspicuous. We describe an intensional calculus: - perspicuous output; - correct but not complete; - can be combined with a complete extensional calculus. 17

18 Intensional calculus Modular intensional calculus: separately computed on periodicities ( P ) and constraints ( C ) C C are the standard ones in STP (i.e., [a,b] C [c,d] = [a,b] [c,d] and C [c,d] = [a+c,b+d]) P? 18

19 Intensional calculus on periodicities Intensional level taking into account only the repetition in a typical common period (i.e., P1 P P2 or P P2). Issues: 1. a one-to to-one one correspondence between the instances of periodicities; 2. collection formalism must be extended to intensionally express the common period; 3. an algorithm must be devised to compute the common period on the basis of two periodicities. 19

20 1. One-to to-one one correspondence From the semantics of <<ev1,ev2>,p1,c1> p1 1 p1 2 p1 3 C1 C1 C1 e1 1 e2 1 e1 2 e2 2 e1 3 e2 3 time 20

21 1. One-to to-one one correspondence From the semantics of <<ev1,ev2>,p1,c1> and of <<ev1,ev2>,p2,c2> p2 1 p2 2 p2 3 C2 e1 1 e2 1 C2 e1 2 e2 2 C2 e1 3 e2 3 time 21

22 1. One-to to-one one correspondence From the semantics, <<ev1,ev2>,p1,c1> and <<ev1,ev2>,p2,c2> are consistent only if: p1 1 p1 2 p1 3 p2 1 p2 2 p2 3 C1 C1 C1 C2 e1 1 e2 1 C2 e1 2 e2 2 C2 e1 3 e2 3 time 22

23 1. One-to to-one one correspondence From the semantics, <<ev1,ev2>,p1,c1> and <<ev1,ev2>,p2,c2> are consistent only if: p1 1 p1 2 p1 3 p2 1 p2 2 p2 3 C1 C2 e1 1 e2 1 C1 C2 e1 2 e2 2 C1 C2 e1 3 e there is a 1 to 1 correspondence between occurrences of P1 and occurrences of P2; time 23

24 1. One-to to-one one correspondence From the semantics, <<ev1,ev2>,p1,c1> and <<ev1,ev2>,p2,c2> are consistent only if: p1 1 p1 2 p1 3 p2 1 p2 2 p2 3 C1 C2 e1 1 e2 1 C1 C2 e1 2 e2 2 C1 C2 e1 3 e there is a 1 to 1 correspondence between occurrences of P1 and occurrences of P2; 2. the corresponding occurrences intersect. time 24

25 1. One-to to-one one correspondence From the semantics, <<ev1,ev2>,p1,c1> and <<ev1,ev2>,p2,c2> are consistent only if: p1 1 p1 2 p1 3 p2 1 p2 2 p2 3 C1 C2 e1 1 e2 1 C1 C2 e1 2 e2 2 C1 C2 e1 3 e there is a 1 to 1 correspondence between occurrences of P1 and occurrences of P2; 2. the corresponding occurrences intersect. E.g., Tue&Wed and Wed&Thu satisfy both the constraints; Tue&Wed and Days do not satisfy 1; Tue&Wed and Thu&Fry do not satisfy 2. time 25

26 2. Extending collection language Collection language extended with - pairwise intersection P Mon&Tue); (e.g., Sun&Mon P - pairwise restricted union P (e.g., Sun&Mon Mon&Tue). (e.g., Sun&Mon P Operators are defined only in case there is a one-to to-one one correspondence between events and take into account corresponding pairs of events. Additionally, union is restricted to provide an empty result if the corresponding pairs do not intersect in time (so that only convex time intervals are coped with) (e.g., no Sun&Mon P Thur&Fri). 26

27 3. Algorithm: simplification rules. Intensional operations perform two types of simplifications: redundancy elimination (intersection of Working-Days and Mondays should be just Mondays and not Working-Days P Mondays); empty periodicity detection (intersection of Mondays and Wednesdays should be empty and not Mondays P Wednesdays). 27

28 3. Algorithm: simplification rules. Periodicities are user-defined defining a priori all the intersections and compositions unfeasible. Relations between user-defined periodicities: P, P, i P, ni P, # P (exhaustive and mutually exclusive) E.g., P1 P P2 iff (there is a one-to to-one one correspondence between the occurrences of P1 and P2 and) temporal inclusion ( )) holds between each corresponding pair of occurrences. 28

29 3. Algorithm: simplification rules. Sets of rules to compute the relation holding between two basic periodicities. E.g., if P1 = n \ P2:during:P3, then P1 P P3, P1 # P P2, P2 # P P3. (if Mon = [1] \ Days:during:Weeks, then Mon P Weeks, Mon # P Days, Days # P Weeks). 29

30 3. Algorithm: simplification rules. Basic periodicities. P1 P P2 P1 P P2 P1 i P P2 P1 P P2 P1 P2 P1 P P2 P P2 P2 P1 P1 P P2 P1 ni P P2 P1 # P P2 E.g., Mon P Weeks Mon P Weeks=Mon and P Weeks=Weeks Weeks. 30

31 3. Algorithm: simplification rules. Composite periodicities. Difficult to find rules to determine which one of the five relations holds between two composite periodicities. Operations between composite periodicities are decomposed by considering pairwise the basic periodicities composing them. E.g., (P1 P P2) P (P 1 P P 2) is empty if Pi ni P P j (i,j {1,2}). Certain simplifications can only be captured considering composite periodicities as a whole not simplification-complete. complete. 31

32 3. Algorithm Adaptation of Floyd-Warshall Warshall s algorithm: 1. for each ev k in periodic events 2. for each ev i, ev j in periodic events 3. let PBC i,j the constraint between ev i and ev j 4. PBC i,j PBC i,j (PBC PBC k,j ) PBC i,j PBC i,j PBC i,k PBC k,j It applies the intersection and composition operations a cubic number of times. 32

33 Extensional constraint propagation Algorithm not complete in consistency checking. E.g., (i) every Mondays ev1 starts 20 hours before ev2,, and (ii) every Mondays ev2 starts 10 hours before ev3. Must consider jointly periodicities and constraints extensional algorithm. 33

34 Extensional constraint propagation Complete extensional algorithm: 1. generate the extensions of the periodicities relative to the time span LCM, least common multiple of the periodicities; 2. generate the instances of the events and add the temporal constraints in the KB; 3. add the constraints that the instances are contained in the time intervals of the proper periodicity; 4. propagate the constraints via an all-pairs shortest path algorithm. 34

35 Outline Introduction Representation formalism Reasoning mechanisms Conclusions 35

36 Conclusions The approach deals with: (i) qualitative and (ii) quantitative periodicity-based temporal constraints, and (iii) considers also user-defined periodicities. It integrates and extends the STP framework and the Leban s formalism. 36

37 Conclusions We have: - singled out five relations between periodicities and used them to - defined the operations of intersection and composition between both basic and composite periodicities; - described an intensional approach, which is correct and provides perspicuous (intensional) output, but is not complete, and - an extensional approach, which can be used to check consistency, and which is correct and complete. 37

38 Conclusions Future work Apply the approach in the domain of clinical therapies. In clinical therapies often events are periodic. Benchmarks of examples from clinical guidelines from Azienda Ospedaliera San Giovanni Battista, Torino, Italy and Cancer Research, London, UK. 38

39 The end. Thanks for your attention

40 Additional slides

41 Intensional calculus on periodicities - P1 P P2 iff NOT P1 P P2 and ( ) temporal inclusion ( )) holds between each corresponding pair of occurrences; - P1 i P P2 iff NOT P1 P P2 and NOT P1 P P2 and ( )) the temporal intersection between each corresponding pair of occurrences is not empty; - P1 ni P P2 iff ( )( ) the temporal intersection between each corresponding pair of occurrences is empty; - P1 # P P2 iff there is not any one-to to-one one correspondence between the occurrences of P1 and P2. 41

42 Intensional calculus on periodicities Example: On Monday, Tom starts to work after Mary, and finishes between 10m and 30m after her (α) <<TW, MW>, Mondays, <(0,+ ), (10m,+ ),(-,+ ),[10m,30m]>>; On working days, Tom works for 8 hours (β) <<TW>,Working-Days, <[480m,480m]>>; On working days, Tom starts to work 10m to 20m after Alice, and finishes between 10m and 30m after her (γ) <<TW,AW>,Working-Days, <[10m,20m],(10m,+ ), (-,+ ),[10m,30m]>>. 42

43 Intensional calculus on periodicities Gives: On Monday, Alice works for 7h50m to 8h20m (δ) <<AW>,Mondays,<[470m,500m]>>; On working days, Mary starts to work 8h20m before to 20m after Alice, and finishes to work between 20m before to 20m after her (ε) <<MW, AW>, Working-Days, < (-500m,20m),( (-20m,510m),( (-500m, 500m,-470m), (-20m,20m)>>.( 43

44 Calculus on composite periodicities In the following, we hypothesize that composite periodicities are put in normal form, as below: (P11 P P12 P P P1s1) P P (Ph1 P Ph2 P P Phsh) where each Pij is a basic periodicity. We also hypothesize that all input composite periodicities (if any) have already been simplified (this can be done in a pre-compilation step). Temporal reasoning on composite periodicities requires to calculate: the intersection P of normal forms; the restricted union P of normal forms (to compute respectively). 44

45 Calculus on composite periodicities Intersection of normal forms. (α) ((P11 P P P1s1) P P (Pg1 P P Pgsg)) P ((P 11 P P P P 1t1) P P P (P h1 P P P hth)). Emptiness detection.. If there are two basic periodicities Pil and P jk such that Pil #P P jk,, then the intersection of the two normal forms is undefined. If there exist two unions of basic periodicities (Pi1 P P Pisi) ) and (P j1 P P P jtj) ) such that Pil in (Pi1 P P P PisiP isi) ) and P jk in (P j1 P P P P jtjp jtj) Pil nip P jk, the intersection of the two normal forms is empty. If no emptiness is detected, the resulting periodicity can be obtained by applying the redundancy elimination rules to the formula obtained by concatenating by P the two input periodicities (i.e., to a formula like (α))( )). 45

46 Calculus on composite periodicities Intersection of normal forms. (α) ((P11 P P P1s1) P P (Pg1 P P Pgsg)) P ((P 11 P P P P 1t1) P P P (P h1 P P P hth)). Redundancy elimination.. If there are two unions of basic periodicities (Pi1 P P Pisi) ) and (P j1 P P P jtj) ) such that P jk in (P j1 P P P P jtjp jtj) s.t. Pil in (Pi1 P P P PisiP isi) Pil P P jk,, then all the other P jp with p k p k can be removed from (P j1 P P P jtj) ) because they surely are unnecessary for computing the result of the intersection (and vice versa, by exchanging the role of the two union sets). Moreover, if P jk in (P j1 P P P P jtjp jtj) ) s.t. Pil in (Pi1 P P P PisiP isi) Pil nip P jk, P jk can be removed (and vice versa). 46

47 Calculus on composite periodicities Union of normal forms. (β)) ((P11 P P P1s1) P P (Pg1 P P Pgsg)) P ((P 11 P P P P 1t1) P P P (P h1 P P P hth)). By applying distributive property, the composite periodicity above can be rewritten as follows: ((P11 P P P1s1) P (P 11 P P P P 1t1)) P P P ((Pg1 P P Pgsg) ) ) P (P h1 P P P hth)) which reduces to the intersection of unions in the form (Pi1 P P Pisi) P P (P j1 P P P jtj). 47

48 Calculus on composite periodicities Union of normal forms. (Pi1 P P Pisi) P P (P j1 P P P jtj). Emptiness detection.. If there exist two basic periodicities Pil and P jk such that Pil #P P jk,, then the union of the two normal forms is undefined. Moreover, let us consider the formula obtained after the application of the distributive property. If there is a union of unions (Pi1 P P Pisi) P P (P j1 P P P jtj) ) which is empty, the overall intersection is empty (from our definition, restricted union may introduce emptiness). Working on the corresponding basic periodicities, this translates to the following rule: if Pil in (Pi1 P P Pisi) ) and P jk in (P j1 P P P jtj) Pil nip P jk, then (Pi1 P P Pisi) P P (P j1 P P P jtj) ) (and the whole union of normal forms) is empty. If no emptiness is detected, the resulting periodicity can be obtained by applying the redundancy elimination rules (to a formula like (β)).( 48

49 Calculus on composite periodicities Union of normal forms. (Pi1 P P Pisi) P P (P j1 P P P jtj). Redundancy elimination.. Every union in the form (Pi1 P P Pisi) P P (P j1 P P P jtj) ) can be simplified as follows: if Pil in (Pi1 P P P PisiP isi) ) and P jk (P j1 P P P jtj) ) s.t. Pil P P jk,, then Pil can be removed from (Pi1 P P Pisi) (and vice versa). Moreover, the rules concerning intersection of normal forms can also be applied at this point. 49

50 Conclusions Related works Several approaches dealing with constraints between periodic events: [Ligozat,, 91; Morris et al., 96]: only periodicity-independent independent (always( always) ) qualitative constraints; [Bettini et al., 02] multiple user-defined granularities between non-repeated events; [Longanantharaj&Gimbrone,, 96] only qualitative constraints; [Terenziani,, 97] periodicity-based duration constraints. 50

Recursive Representation of Periodicity and Temporal Reasoning

Recursive Representation of Periodicity and Temporal Reasoning Recursive Representation of Periodicity and Temporal Reasoning Luca Anselma Dipartimento di Informatica Università di Torino, Italy anselma@di.unito.it Outline Introduction Representation formalism Reasoning

More information

Paolo Terenziani PERSONAL DATA. Paolo Terenziani was born in Torino on BIO AND EDUCATION

Paolo Terenziani PERSONAL DATA. Paolo Terenziani was born in Torino on BIO AND EDUCATION Paolo Terenziani PERSONAL DATA Paolo Terenziani was born in Torino on 4.7.1963. BIO AND EDUCATION On 3/7/1987 he got the Master degree in Computer Science at the University of Turin with 110/110 and laude.

More information

Towards an implicit treatment of periodically-repeated medical data

Towards an implicit treatment of periodically-repeated medical data C. Safron, S.Reti an H. Marin MEDINFO 2010, IOS Press 2010, IMIA and SAHIA Towards an implicit treatment of periodically-repeated medical data Bela Stantic a, Paolo Terenziani b, Abdul Sattar a, Alessio

More information

Applying Artificial Intelligence to Clinical Guidelines: the GLARE Approach?

Applying Artificial Intelligence to Clinical Guidelines: the GLARE Approach? Applying Artificial Intelligence to Clinical Guidelines: the GLARE Approach? Paolo Terenziani 1, Stefania Montani 1, Alessio Bottrighi 1, Mauro Torchio 2, Gianpaolo Molino 2, Luca Anselma 3, and Gianluca

More information

One challenge is for applications to provide a human-friendly

One challenge is for applications to provide a human-friendly IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 15, NO. 2, MARCH/APRIL 2003 1 Symbolic User-Defined Periodicity in Temporal Relational Databases Paolo Terenziani Abstract Calendars and periodicity

More information

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY

ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING

More information

A New Efficient Algorithm for Solving the Simple Temporal Problem

A New Efficient Algorithm for Solving the Simple Temporal Problem University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Conference and Workshop Papers Computer Science and Engineering, Department of 2003 A New Efficient Algorithm for Solving

More information

Direct Conversions among Multi-Granularity Temporal Constraints

Direct Conversions among Multi-Granularity Temporal Constraints From: AAAI Technical Report WS-02-17. Compilation copyright 2002, AAAI (www.aaai.org). All rights reserved. Direct Conversions among Multi-Granularity Temporal Constraints Claudio Bettini and Simone Ruffini

More information

Generating Tests for Detecting Faults in Feature Models

Generating Tests for Detecting Faults in Feature Models Generating Tests for Detecting Faults in Feature Models Paolo Arcaini 1, Angelo Gargantini 2, Paolo Vavassori 2 1 Charles University in Prague, Czech Republic 2 University of Bergamo, Italy Outline Feature

More information

Strong Controllability of Disjunctive Temporal Problems with Uncertainty

Strong Controllability of Disjunctive Temporal Problems with Uncertainty Strong Controllability of Disjunctive Temporal Problems with Uncertainty Bart Peintner 1, Kristen Brent Venable 2, and Neil Yorke-Smith 1 1 Artificial Intelligence Center, SRI International. {peintner,nysmith}@ai.sri.com

More information

Eddie Schwalb, Rina Dechter. It is well known that all these tasks are NP-hard.

Eddie Schwalb, Rina Dechter.  It is well known that all these tasks are NP-hard. Coping With Disjunctions in Temporal Constraint Satisfaction Problems 3 Eddie Schwalb, Rina Dechter Department of Information and Computer Science University of California at Irvine, CA 977 eschwalb@ics.uci.edu,

More information

UNIT 5 GRAPH. Application of Graph Structure in real world:- Graph Terminologies:

UNIT 5 GRAPH. Application of Graph Structure in real world:- Graph Terminologies: UNIT 5 CSE 103 - Unit V- Graph GRAPH Graph is another important non-linear data structure. In tree Structure, there is a hierarchical relationship between, parent and children that is one-to-many relationship.

More information

Journal of Biomedical Informatics

Journal of Biomedical Informatics Journal of Biomedical Informatics 46 (2013) 363 376 Contents lists available at SciVerse ScienceDirect Journal of Biomedical Informatics journal homepage: www.elsevier.com/locate/yjbin Managing proposals

More information

A System Prototype for Solving Multi-granularity Temporal CSP

A System Prototype for Solving Multi-granularity Temporal CSP 142 A System Prototype for Solving Multi-granularity Temporal CSP Claudio Bettini, Sergio Mascetti, and Vincenzo Pupillo DICo Università di Milano, Italy Abstract. Time granularity constraint reasoning

More information

Steve Levine. Programs with Flexible Time. When? Tuesday, Feb 16 th. courtesy of JPL

Steve Levine. Programs with Flexible Time. When? Tuesday, Feb 16 th. courtesy of JPL Programs with Flexible Time When? Contributions: Brian Williams Patrick Conrad Simon Fang Paul Morris Nicola Muscettola Pedro Santana Julie Shah John Stedl Andrew Wang Steve Levine Tuesday, Feb 16 th courtesy

More information

Flexible Execution of Plans with Choice and Uncertainty Patrick R Conrad and Brian C Williams

Flexible Execution of Plans with Choice and Uncertainty Patrick R Conrad and Brian C Williams Computer Science and Artificial Intelligence Laboratory Technical Report MIT-CSAIL-TR-2011-002 January 15, 2011 Flexible Execution of Plans with Choice and Uncertainty Patrick R Conrad and Brian C Williams

More information

Regular Languages and Regular Expressions

Regular Languages and Regular Expressions Regular Languages and Regular Expressions According to our definition, a language is regular if there exists a finite state automaton that accepts it. Therefore every regular language can be described

More information

Relational Algebra 1. Week 4

Relational Algebra 1. Week 4 Relational Algebra 1 Week 4 Relational Query Languages Query languages: Allow manipulation and retrieval of data from a database. Relational model supports simple, powerful QLs: Strong formal foundation

More information

Giovanni De Micheli. Integrated Systems Centre EPF Lausanne

Giovanni De Micheli. Integrated Systems Centre EPF Lausanne Two-level Logic Synthesis and Optimization Giovanni De Micheli Integrated Systems Centre EPF Lausanne This presentation can be used for non-commercial purposes as long as this note and the copyright footers

More information

SPIN Model Checking for the Verification of Clinical Guidelines

SPIN Model Checking for the Verification of Clinical Guidelines SPIN Model Checking for the Verification of Clinical Guidelines Paolo Terenziani and Laura Giordano and Alessio Bottrighi and Stefania Montani and Loredana Donzella 1 Abstract. In this paper, we propose

More information

Cluster Analysis. Angela Montanari and Laura Anderlucci

Cluster Analysis. Angela Montanari and Laura Anderlucci Cluster Analysis Angela Montanari and Laura Anderlucci 1 Introduction Clustering a set of n objects into k groups is usually moved by the aim of identifying internally homogenous groups according to a

More information

1 Non greedy algorithms (which we should have covered

1 Non greedy algorithms (which we should have covered 1 Non greedy algorithms (which we should have covered earlier) 1.1 Floyd Warshall algorithm This algorithm solves the all-pairs shortest paths problem, which is a problem where we want to find the shortest

More information

The Shortest Path Problem. The Shortest Path Problem. Mathematical Model. Integer Programming Formulation

The Shortest Path Problem. The Shortest Path Problem. Mathematical Model. Integer Programming Formulation The Shortest Path Problem jla,jc@imm.dtu.dk Department of Management Engineering Technical University of Denmark The Shortest Path Problem Given a directed network G = (V,E,w) for which the underlying

More information

Modelling and Solving Temporal Reasoning as Propositional Satisfiability

Modelling and Solving Temporal Reasoning as Propositional Satisfiability Modelling and Solving Temporal Reasoning as Propositional Satisfiability Duc Nghia Pham a,b,, John Thornton a,b and Abdul Sattar a,b a SAFE Program NICTA Ltd., Queensland, Australia b Institute for Integrated

More information

Extending Temporal Databases to Deal with Telic/Atelic Medical Data

Extending Temporal Databases to Deal with Telic/Atelic Medical Data Extending Temporal Databases to Deal with Telic/Atelic Medical Data Paolo Terenziani a,, Richard T. Snodgrass b, Alessio Bottrighi a, Mauro Torchio c, Gianpaolo Molino c a DI, Univ. Piemonte Orientale

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION The concept of fuzzy set as a generalization of crisp set has been introduced in the previous chapter. Relations between elements of crisp sets can be extended

More information

Planning and Execution with Flexible Timelines: a Formal Account

Planning and Execution with Flexible Timelines: a Formal Account Noname manuscript No. (will be inserted by the editor) Planning and Execution with Flexible Timelines: a Formal Account Marta Cialdea Mayer Andrea Orlandini Alessandro Umbrico Received: TBD / Accepted:

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Shortest Path Problem G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 3 GG A.I. 1/42 Outline 1 The Shortest Path Problem Introduction

More information

Robust Execution of Temporal Plans. Assignments. Remember: Problem Set #5 due today, Wed, Oct. 6 th, Problem Set #6 out today.

Robust Execution of Temporal Plans. Assignments. Remember: Problem Set #5 due today, Wed, Oct. 6 th, Problem Set #6 out today. Massachusetts Institute of Technology Robust Execution of Temporal Plans Slide Contributions: Andreas Hofmann Julie Shah Prof Brian Williams 16.410 / 16.413 October.6 th, 2010 Assignments Remember: Problem

More information

Discrete Mathematics Lecture 4. Harper Langston New York University

Discrete Mathematics Lecture 4. Harper Langston New York University Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a

More information

A Framework for Decentralized Qualitative Model-Based Diagnosis

A Framework for Decentralized Qualitative Model-Based Diagnosis A Framework for Decentralized Qualitative Model-Based Diagnosis Luca Console, Claudia Picardi UniversitàdiTorino Dipartimento di Informatica Corso Svizzera 185, 10149, Torino, Italy lconsole,picardi@di.unito.it

More information

Consistency and Set Intersection

Consistency and Set Intersection Consistency and Set Intersection Yuanlin Zhang and Roland H.C. Yap National University of Singapore 3 Science Drive 2, Singapore {zhangyl,ryap}@comp.nus.edu.sg Abstract We propose a new framework to study

More information

EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization

EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Dataflow Lecture: SDF, Kahn Process Networks Stavros Tripakis University of California, Berkeley Stavros Tripakis: EECS

More information

Problem 1 (20 pt) Answer the following questions, and provide an explanation for each question.

Problem 1 (20 pt) Answer the following questions, and provide an explanation for each question. Problem 1 Answer the following questions, and provide an explanation for each question. (5 pt) Can linear regression work when all X values are the same? When all Y values are the same? (5 pt) Can linear

More information

Search and Intersection. O Rourke, Chapter 7 de Berg et al., Chapter 11

Search and Intersection. O Rourke, Chapter 7 de Berg et al., Chapter 11 Search and Intersection O Rourke, Chapter 7 de Berg et al., Chapter 11 Announcements Assignment 3 web-page has been updated: Additional extra credit Hints for managing a dynamic half-edge representation

More information

10. Network dimensioning

10. Network dimensioning Partly based on slide material by Samuli Aalto and Jorma Virtamo ELEC-C7210 Modeling and analysis of communication networks 1 Contents Introduction Parameters: topology, routing and traffic Dimensioning

More information

Branch-and-bound: an example

Branch-and-bound: an example Branch-and-bound: an example Giovanni Righini Università degli Studi di Milano Operations Research Complements The Linear Ordering Problem The Linear Ordering Problem (LOP) is an N P-hard combinatorial

More information

A Software Architecture for Progressive Scanning of On-line Communities

A Software Architecture for Progressive Scanning of On-line Communities A Software Architecture for Progressive Scanning of On-line Communities Roberto Baldoni, Fabrizio d Amore, Massimo Mecella, Daniele Ucci Sapienza Università di Roma, Italy Motivations On-line communities

More information

Fine-grained Compatibility and Replaceability Analysis of Timed Web Service Protocols

Fine-grained Compatibility and Replaceability Analysis of Timed Web Service Protocols Fine-grained Compatibility and Replaceability Analysis of Timed Web Service Protocols Julien Ponge 1,2, Boualem Benatallah 2, Fabio Casati 3 and Farouk Toumani 1 (1) Université Blaise Pascal, Clermont-Ferrand,

More information

Lecture 6,

Lecture 6, Lecture 6, 4.16.2009 Today: Review: Basic Set Operation: Recall the basic set operator,!. From this operator come other set quantifiers and operations:!,!,!,! \ Set difference (sometimes denoted, a minus

More information

Constraint Programming. Global Constraints. Amira Zaki Prof. Dr. Thom Frühwirth. University of Ulm WS 2012/2013

Constraint Programming. Global Constraints. Amira Zaki Prof. Dr. Thom Frühwirth. University of Ulm WS 2012/2013 Global Constraints Amira Zaki Prof. Dr. Thom Frühwirth University of Ulm WS 2012/2013 Amira Zaki & Thom Frühwirth University of Ulm Page 1 WS 2012/2013 Overview Classes of Constraints Global Constraints

More information

from notes written mostly by Dr. Carla Savage: All Rights Reserved

from notes written mostly by Dr. Carla Savage: All Rights Reserved CSC 505, Fall 2000: Week 9 Objectives: learn about various issues related to finding shortest paths in graphs learn algorithms for the single-source shortest-path problem observe the relationship among

More information

VERTEX MAPS FOR TREES: ALGEBRA AND PERIODS OF PERIODIC ORBITS. Chris Bernhardt

VERTEX MAPS FOR TREES: ALGEBRA AND PERIODS OF PERIODIC ORBITS. Chris Bernhardt VERTEX MAPS FOR TREES: ALGEBRA AND PERIODS OF PERIODIC ORBITS CHRIS BERNHARDT Abstract. Let T be a tree with n vertices. Let f : T T be continuous and suppose that the n vertices form a periodic orbit

More information

IPMU July 2-7, 2006 Paris, France

IPMU July 2-7, 2006 Paris, France IPMU July 2-7, 2006 Paris, France Information Processing and Management of Uncertainty in Knowledge-Based Systems Conceptual Design and Implementation of the Salem Chakhar 1 and Abelkader Telmoudi 2 1

More information

Reducing Clocks in Timed Automata while Preserving Bisimulation

Reducing Clocks in Timed Automata while Preserving Bisimulation Reducing Clocks in Timed Automata while Preserving Bisimulation Shibashis Guha Chinmay Narayan S. Arun-Kumar Indian Institute of Technology Delhi {shibashis, chinmay, sak}@cse.iitd.ac.in arxiv:1404.6613v2

More information

On the Quest for an Acyclic Graph

On the Quest for an Acyclic Graph On the Quest for an Acyclic Graph Mikoláš Janota 1 Radu Grigore 2 Vasco Manquinho 1 RCRA 2017, Bari 1 INESC-ID/IST, University of Lisbon, Portugal 2 School of Computing, University of Kent, UK Janota et

More information

CSE 101, Winter Design and Analysis of Algorithms. Lecture 11: Dynamic Programming, Part 2

CSE 101, Winter Design and Analysis of Algorithms. Lecture 11: Dynamic Programming, Part 2 CSE 101, Winter 2018 Design and Analysis of Algorithms Lecture 11: Dynamic Programming, Part 2 Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Goal: continue with DP (Knapsack, All-Pairs SPs, )

More information

K-structure, Separating Chain, Gap Tree, and Layered DAG

K-structure, Separating Chain, Gap Tree, and Layered DAG K-structure, Separating Chain, Gap Tree, and Layered DAG Presented by Dave Tahmoush Overview Improvement on Gap Tree and K-structure Faster point location Encompasses Separating Chain Better storage Designed

More information

Definability and full abstraction in lambda-calculi

Definability and full abstraction in lambda-calculi Definability and full abstraction in lambda-calculi Antonio Bucciarelli Laboratoire Preuves, Programmes et Systèmes Université Paris Diderot Outline 1 Introduction 2 The full abstraction problem for PCF

More information

Paraver internals and details. BSC Performance Tools

Paraver internals and details. BSC Performance Tools Paraver internals and details BSC Performance Tools overview 2 Paraver: Performance Data browser Raw data tunable Seeing is believing Performance index : s(t) (piecewise constant) Identifier of function

More information

Activity Planning and Execution I: Operator-based Planning and Plan Graphs. Assignments

Activity Planning and Execution I: Operator-based Planning and Plan Graphs. Assignments Activity Planning and Execution I: Operator-based Planning and Plan Graphs Slides draw upon material from: Prof. Maria Fox, Univ Strathclyde Brian C. Williams 16.410-13 October 4 th, 2010 Assignments Remember:

More information

On Combinations of Binary Qualitative Constraint Calculi

On Combinations of Binary Qualitative Constraint Calculi On Combinations of Binary Qualitative Constraint Calculi Stefan Wölfl and Matthias Westphal Department of Computer Science, University of Freiburg Georges-Köhler-Allee, 79110 Freiburg, Germany {woelfl,

More information

Determining Resource Needs of Autonomous Agents in Decoupled Plans

Determining Resource Needs of Autonomous Agents in Decoupled Plans Determining Resource Needs of Autonomous Agents in Decoupled Plans Jasper Oosterman a Remco Ravenhorst a Pim van Leeuwen b Cees Witteveen a a Delft University of Technology, Algorithmics group, Delft b

More information

Toward Heterogeneous Cardinal Direction Calculus

Toward Heterogeneous Cardinal Direction Calculus Toward Heterogeneous Cardinal Direction Calculus Yohei Kurata and Hui Shi SFB/TR 8 Spatial Cognition, Universität Bremen Postfach 330 440, 28334 Bremen, Germany {ykurata,shi}@informatik.uni-bremen.de Abstract.

More information

Context-Free Languages & Grammars (CFLs & CFGs) Reading: Chapter 5

Context-Free Languages & Grammars (CFLs & CFGs) Reading: Chapter 5 Context-Free Languages & Grammars (CFLs & CFGs) Reading: Chapter 5 1 Not all languages are regular So what happens to the languages which are not regular? Can we still come up with a language recognizer?

More information

Lectures 12 and 13 Dynamic programming: weighted interval scheduling

Lectures 12 and 13 Dynamic programming: weighted interval scheduling Lectures 12 and 13 Dynamic programming: weighted interval scheduling COMP 523: Advanced Algorithmic Techniques Lecturer: Dariusz Kowalski Lectures 12-13: Dynamic Programming 1 Overview Last week: Graph

More information

FCA-based Search for Duplicate objects in Ontologies

FCA-based Search for Duplicate objects in Ontologies FCA-based Search for Duplicate objects in Ontologies Dmitry A. Ilvovsky and Mikhail A. Klimushkin National Research University Higher School of Economics, School of Applied Mathematics and Informational

More information

Efficient Algorithms for Functional Constraints

Efficient Algorithms for Functional Constraints Efficient Algorithms for Functional Constraints Yuanlin Zhang 1, Roland HC Yap 2, Chendong Li 1, and Satyanarayana Marisetti 1 1 Texas Tech University, USA 2 National University of Singapore, Singapore

More information

All-Pairs Shortest Paths - Floyd s Algorithm

All-Pairs Shortest Paths - Floyd s Algorithm All-Pairs Shortest Paths - Floyd s Algorithm Parallel and Distributed Computing Department of Computer Science and Engineering (DEI) Instituto Superior Técnico October 31, 2011 CPD (DEI / IST) Parallel

More information

Query Decomposition and Data Localization

Query Decomposition and Data Localization Query Decomposition and Data Localization Query Decomposition and Data Localization Query decomposition and data localization consists of two steps: Mapping of calculus query (SQL) to algebra operations

More information

Multi Domain Logic and its Applications to SAT

Multi Domain Logic and its Applications to SAT Multi Domain Logic and its Applications to SAT Tudor Jebelean RISC Linz, Austria Tudor.Jebelean@risc.uni-linz.ac.at Gábor Kusper Eszterházy Károly College gkusper@aries.ektf.hu Abstract We describe a new

More information

NFAs and Myhill-Nerode. CS154 Chris Pollett Feb. 22, 2006.

NFAs and Myhill-Nerode. CS154 Chris Pollett Feb. 22, 2006. NFAs and Myhill-Nerode CS154 Chris Pollett Feb. 22, 2006. Outline Bonus Questions Equivalence with Finite Automata Myhill-Nerode Theorem. Bonus Questions These questions are open to anybody. I will only

More information

Reconstruction of Filament Structure

Reconstruction of Filament Structure Reconstruction of Filament Structure Ruqi HUANG INRIA-Geometrica Joint work with Frédéric CHAZAL and Jian SUN 27/10/2014 Outline 1 Problem Statement Characterization of Dataset Formulation 2 Our Approaches

More information

Flexible Execution of Plans with Choice and Uncertainty. Patrick Raymond Conrad

Flexible Execution of Plans with Choice and Uncertainty. Patrick Raymond Conrad Flexible Execution of Plans with Choice and Uncertainty by Patrick Raymond Conrad Submitted to the Department of Aeronautics and Astronautics in partial fulfillment of the requirements for the degree of

More information

CSE 105 THEORY OF COMPUTATION

CSE 105 THEORY OF COMPUTATION CSE 105 THEORY OF COMPUTATION Spring 2018 http://cseweb.ucsd.edu/classes/sp18/cse105-ab/ Today's learning goals Sipser Section 2.2 Define push-down automata informally and formally Trace the computation

More information

Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis

Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis Jochen Renz Institut fiir Informatik, Albert-Ludwigs-Universitat Am Flughafen 17, 79110 Freiburg, Germany Abstract We

More information

Homework. Announcements. Before We Start. Languages. Plan for today. Chomsky Normal Form. Final Exam Dates have been announced

Homework. Announcements. Before We Start. Languages. Plan for today. Chomsky Normal Form. Final Exam Dates have been announced Homework Homework #3 returned Homework #4 due today Homework #5 Pg 169 -- Exercise 4 Pg 183 -- Exercise 4c,e,i Pg 184 -- Exercise 10 Pg 184 -- Exercise 12 Pg 185 -- Exercise 17 Due 10 / 17 Announcements

More information

Questions? Static Semantics. Static Semantics. Static Semantics. Next week on Wednesday (5 th of October) no

Questions? Static Semantics. Static Semantics. Static Semantics. Next week on Wednesday (5 th of October) no Questions? First exercise is online: http://www.win.tue.nl/~mvdbrand/courses/glt/1112/ Deadline 17 th of October Next week on Wednesday (5 th of October) no lectures!!! Primitive types Primitive value

More information

Non-exhaustive, Overlapping k-means

Non-exhaustive, Overlapping k-means Non-exhaustive, Overlapping k-means J. J. Whang, I. S. Dhilon, and D. F. Gleich Teresa Lebair University of Maryland, Baltimore County October 29th, 2015 Teresa Lebair UMBC 1/38 Outline Introduction NEO-K-Means

More information

XFST2FSA. Comparing Two Finite-State Toolboxes

XFST2FSA. Comparing Two Finite-State Toolboxes : Comparing Two Finite-State Toolboxes Department of Computer Science University of Haifa July 30, 2005 Introduction Motivation: finite state techniques and toolboxes The compiler: Compilation process

More information

As a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.

As a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9. II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,

More information

A Tabu Search Heuristic for the Generalized Traveling Salesman Problem

A Tabu Search Heuristic for the Generalized Traveling Salesman Problem A Tabu Search Heuristic for the Generalized Traveling Salesman Problem Jacques Renaud 1,2 Frédéric Semet 3,4 1. Université Laval 2. Centre de Recherche sur les Technologies de l Organisation Réseau 3.

More information

Community detection. Leonid E. Zhukov

Community detection. Leonid E. Zhukov Community detection Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Network Science Leonid E.

More information

Fundamentals of Software Engineering

Fundamentals of Software Engineering Fundamentals of Software Engineering Reasoning about Programs with Dynamic Logic - Part I Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard

More information

Chapter 3 Linear Structures: Lists

Chapter 3 Linear Structures: Lists Plan Chapter 3 Linear Structures: Lists 1. Two constructors for lists... 3.2 2. Lists... 3.3 3. Basic operations... 3.5 4. Constructors and pattern matching... 3.6 5. Simple operations on lists... 3.9

More information

XVIII Open Cup named after E.V. Pankratiev Stage 10, Grand Prix of Korea, Sunday, February 4, 2018

XVIII Open Cup named after E.V. Pankratiev Stage 10, Grand Prix of Korea, Sunday, February 4, 2018 Problem A. Donut file: XVIII Open Cup named after E.V. Pankratiev 3 seconds 1024 mebibytes In this problem, we will use Chebyshev distance on a Cartesian plane. The Chebyshev distance between two points

More information

BDDC v2 A basic bdd-based logical calculator

BDDC v2 A basic bdd-based logical calculator BDDC v2 A basic bdd-based logical calculator Pascal RAYMOND November 24, 2008, (rev. September 28, 2015) BDDC is a tool for manipulating logical formula. It is based on a Binary Decision Diagram library,

More information

Power Set of a set and Relations

Power Set of a set and Relations Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}

More information

Denotational Semantics. Domain Theory

Denotational Semantics. Domain Theory Denotational Semantics and Domain Theory 1 / 51 Outline Denotational Semantics Basic Domain Theory Introduction and history Primitive and lifted domains Sum and product domains Function domains Meaning

More information

CHAPTER 3 FUZZY RELATION and COMPOSITION

CHAPTER 3 FUZZY RELATION and COMPOSITION CHAPTER 3 FUZZY RELATION and COMPOSITION Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A,

More information

Towards a Semantic Web Modeling Language

Towards a Semantic Web Modeling Language Towards a Semantic Web Modeling Language Draft Christoph Wernhard Persist AG Rheinstr. 7c 14513 Teltow Tel: 03328/3477-0 wernhard@persistag.com May 25, 2000 1 Introduction The Semantic Web [2] requires

More information

PBW 654 Applied Statistics - I Urban Operations Research. Unit 3. Network Modelling

PBW 654 Applied Statistics - I Urban Operations Research. Unit 3. Network Modelling PBW 54 Applied Statistics - I Urban Operations Research Unit 3 Network Modelling Background So far, we treated urban space as a continuum, where an entity could travel from any point to any other point

More information

Stochastic Petri Nets Supporting Dynamic Reliability Evaluation

Stochastic Petri Nets Supporting Dynamic Reliability Evaluation International Journal of Materials & Structural Reliability Vol.4, No.1, March 2006, 65-77 International Journal of Materials & Structural Reliability Stochastic Petri Nets Supporting Dynamic Reliability

More information

CONSTRAINT Networks Chapters 1-2

CONSTRAINT Networks Chapters 1-2 CONSTRAINT Networks Chapters 1-2 Compsci-275 Fall 2010 Fall 2010 1 Class Information Instructor: Rina Dechter Days: Time: Tuesday & Thursday 11:00-12:20 pm Class page: http://www.ics.uci.edu/~dechter/ics-275a/fall-2010/

More information

Soft constraints: Polynomial classes, Applications

Soft constraints: Polynomial classes, Applications Soft constraints: Polynomial classes, Applications T. Schiex INRA - Toulouse, France Padova 2004 - Soft constraints p. 1 Polynomial classes structural classes: when the constraint (hyper)-graph has good

More information

Meta-programming with Names and Necessity p.1

Meta-programming with Names and Necessity p.1 Meta-programming with Names and Necessity Aleksandar Nanevski Carnegie Mellon University ICFP, Pittsburgh, 05 October 2002 Meta-programming with Names and Necessity p.1 Meta-programming Manipulation of

More information

Computer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth

Computer Science and Mathematics. Part I: Fundamental Mathematical Concepts Winfried Kurth Computer Science and Mathematics Part I: Fundamental Mathematical Concepts Winfried Kurth http://www.uni-forst.gwdg.de/~wkurth/csm17_home.htm 1. Mathematical Logic Propositions - can be either true or

More information

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:

Chapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below: Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have

More information

Modeling and Reasoning with Star Calculus: An Extended Abstract

Modeling and Reasoning with Star Calculus: An Extended Abstract Modeling and Reasoning with Star Calculus: An Extended Abstract Debasis Mitra Department of Computer Sciences Florida Institute of Technology Melbourne, FL 32901, USA E-mail: dmitra@cs.fit.edu 1. Introduction

More information

An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem

An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem AI Communications 17 (2004) 213 221 213 IOS Press An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem Berthe Y. Choueiry and Lin Xu Constraint Systems Laboratory, Department

More information

2 Review of Set Theory

2 Review of Set Theory 2 Review of Set Theory Example 2.1. Let Ω = {1, 2, 3, 4, 5, 6} 2.2. Venn diagram is very useful in set theory. It is often used to portray relationships between sets. Many identities can be read out simply

More information

Abstract Syntax Trees L3 24

Abstract Syntax Trees L3 24 Abstract Syntax Trees L3 24 Formal languages An extensional view of what constitutes a formal language is that it is completely determined by the set of words in the dictionary : Given an alphabet Σ, wecallanysubsetofσ

More information

Temporal Databases. Week 8. (Chapter 22 & Notes)

Temporal Databases. Week 8. (Chapter 22 & Notes) Temporal Databases Week 8 (Chapter 22 & Notes) 1 Introduction Temporal database contains historical,timevarying as well as current data. Note: historical record is a misleading term - a temporal database

More information

Analysis of Algorithms Prof. Karen Daniels

Analysis of Algorithms Prof. Karen Daniels UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Spring, 2010 Lecture 2 Tuesday, 2/2/10 Design Patterns for Optimization Problems Greedy Algorithms Algorithmic Paradigm Context

More information

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12.

AMS /672: Graph Theory Homework Problems - Week V. Problems to be handed in on Wednesday, March 2: 6, 8, 9, 11, 12. AMS 550.47/67: Graph Theory Homework Problems - Week V Problems to be handed in on Wednesday, March : 6, 8, 9,,.. Assignment Problem. Suppose we have a set {J, J,..., J r } of r jobs to be filled by a

More information

Integrity Constraints For Access Control Models

Integrity Constraints For Access Control Models 1 / 19 Integrity Constraints For Access Control Models Romuald THION, Stéphane COULONDRE November 27 2008 2 / 19 Outline 1 Introduction 2 3 4 5 3 / 19 Problem statement From Role-BAC to time (Generalized-Temporal-RBAC,

More information

11 Sets II Operations

11 Sets II Operations 11 Sets II Operations Tom Lewis Fall Term 2010 Tom Lewis () 11 Sets II Operations Fall Term 2010 1 / 12 Outline 1 Union and intersection 2 Set operations 3 The size of a union 4 Difference and symmetric

More information

Abstract. I. Introduction. 2. The T CS ode1. vide answers to a variety of additional queries.

Abstract. I. Introduction. 2. The T CS ode1. vide answers to a variety of additional queries. From: AAAI-93 Proceedings. Copyright 1993, AAAI (www.aaai.org). All rights reserved. in Temporal it Constraint Eddie Schwalb, Rina Dechter Department of Information and Computer Science University of California

More information

Where Can We Draw The Line?

Where Can We Draw The Line? Where Can We Draw The Line? On the Hardness of Satisfiability Problems Complexity 1 Introduction Objectives: To show variants of SAT and check if they are NP-hard Overview: Known results 2SAT Max2SAT Complexity

More information

Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs

Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs Symbolic Buffer Sizing for Throughput-Optimal Scheduling of Dataflow Graphs Anan Bouakaz Pascal Fradet Alain Girault Real-Time and Embedded Technology and Applications Symposium, Vienna April 14th, 2016

More information