The foundations of spatial change. Mike Worboys Department of Spatial Information Science and Engineering University of Maine
|
|
- Cassandra Barnett
- 5 years ago
- Views:
Transcription
1 The foundations of spatial change Mike Worboys Department of Spatial Information Science and Engineering University of Maine
2 Things that involve change State (part of situation) Absence of change Process (1) Change as it is actually occurring, something going on Event A chunk of change picked out as an individual from the ongoing flux Process (2) A structured succession of events ThinkSpatial 2
3 The geospatial context of change ThinkSpatial 3
4 process event change happens to state change continuant ThinkSpatial 4
5 PROCESS growing in size, changing shape, changing color STATE CHANGE area shape color ThinkSpatial 5
6 STATE CHANGE area shape color EVENT growing in size, changing shape, changing color ON Christmas Day, /25/ /26/2010 ThinkSpatial 6
7 Kinds of change types of change location change size change shape change topological change dimension change identity change posture change semantic change viewpoint change ThinkSpatial 7
8 Perspectives on change egocentric vs. allocentric Eulerian vs. Lagrangian ThinkSpatial 8
9 Measurement of change quantitative vs. qualitative phase space vs. mode space ThinkSpatial 9
10 Motion Aristotle: motion is change of any sort, including qualitative change (change of space was given the more specific term, locomotion ). Newton s world view has motion as a central piece. STIS: change-based and movement-based models.
11 Absolute and relative motion
12 Individual or aggregate motion
13 Real or apparent motion
14 Fictive motion
15 Another type of movement
16 Another type of movement
17 The geometry of change Erlangen program (Felix Klein 1872) A geometry is the study of a those properties invariant under a particular class of changes. ThinkSpatial 17
18 Rigid body motion Euclidean geometry Those properties of shapes invariant under rotations, reflections, and translations. length, angle, parallelism, area, congruence ThinkSpatial 18
19 Scaling Affine geometry Those properties of shapes invariant under rotations, reflections, and translations. angle, parallelism, similarities ThinkSpatial 19
20 Change of viewpoint Projective geometry Those properties of shapes invariant under perspective transformations colinearity, conic sections, ThinkSpatial 20
21 Change of connectivity Topology (and it s subset graph theory) Those properties of shapes invariant under homeomorphisms connectedness, genus, dimension, compactness, ThinkSpatial 21
22 Time the container of change ThinkSpatial 22
23 Reasoning about time (e.g., Allen s interval calculus) ThinkSpatial 23
24 Time Temporal structure Allen s interval calculus Time-varying propositions Fluents Event type Predicates Occurs (event, time) HoldsAt (fluent, time) Initiates (event, fluent, time) Terminates (event, fluent, time) Theory examples A fluent is true once it has been initiated by an event. Reasoning about events (McCarthy, Hayes, Kowalski and Sergot, Allen) A fluent is false once it has been terminated and before it has been initiated. ThinkSpatial 24
25 Working with processes Robin Milner
26 Process Aggregation composition parallelism choice reaction/communication
27 Basic process and mobility concepts Process names and constructions Process equivalence Independence vs. reaction Synchronous vs. asynchronous Determinism vs. non-determinism Operations Composition a.p Disjunction P+Q Parallelism P Q Reaction ((in a)p+q) ((out a)r+s) P R Replication!P Ambient n[p]
28 Process model c q 0 a s c r b This process is deterministic, as there is at most one transition (q, a, q ), for each pair (q, a). Process notation: Q 0 == ar R == bs + cq 0 S == cq 0
29 Process model c a q 0 a s t c c r b This process is nondeterministic, as there is more than one transition a with start state q 0. Process notation: Q 0 == ar + at = a(r+t) R == bs + cq 0 S == cq 0 T == cq 0
30 Process model q 0 c a s t 0 a c r b d u These processes communicate via input action a and output action a. The combined process is Q 0 T 0 Process notation: Q 0 == ar R == bs + cq 0 S == cq 0 == au T 0 Q 0 T 0 U R U == dt 0
31 Topological change
32 Two continuous functions are called homotopic if one can be "continuously deformed" into the other. Such a deformation is called a homotopy between the two functions. Homotopy ThinkSpatial 32
33 Homotopy (formal definition) A homotopy between two continuous functions f and g from a topological space X to a topological space Y is a continuous function 0 f 0 H : X *0,1+ Y such that, if x X then H(x,0) = f(x) H(x,1) = g(x). g H ThinkSpatial 33
34 Homotopic equivalence ThinkSpatial 34
35 Continuous change ThinkSpatial 35
36 Egenhofer s relations on S 2 ThinkSpatial 36
37 ?
38
39
40
41 Seeking the atoms What are the points, lines and polygons of topological change
42
43 Tree morphisms to represent topological change n 0 n' 0 node to node n 1 n' 1 n 2 n' 2 n 3 n 4 n' 3
44
45 Atomic Changes n 0 n' 0 n 0 n' 0 n 1 n' 1 n' 1 T 1 T 2 n 1 n 2 n' 1 T 1 T 2 n' 0 n 2 T 1 T 2 n 0 atomic insert atomic merge I atomic merge II n 0 n' 0 n 0 n' 0 n1 n' 1 n' 0 n 1 n 1 n' 1 n' 2 T 1 T 2 T 1 T 2 n 0 n' 2 T 1 T 2 atomic delete atomic split I atomic split II
46 Specifying Complex Changes The Canonical Form Theorem Every complex change C can be written as a composition in a particular and unique way of inserts, splits, merges, and deletes. C = I 1 S 1 M 1 D 1
47 Further work: Spatio-semantic change
48 Different types of quality involved in topological change
49 or????
50 Detecting change using decentralized approaches ThinkSpatial 50
51 Sensors responding to a dynamic field
52 Dynamic fields There are many examples of fields that change through time pollution plumes ocean currents population movements ST temperature variations Can we mine the dynamic field for events?
53 Approach Triangulate the spatial field according to the disposition of the sensors. Provide a threshold to distinguish regions of high activity. Use distributed algorithms to determine significant events in the sensor network, e.g., region splitting.
54 Approximating the Scalar Field scalar field discretization approximation
55 Selecting a Threshold
56 Effect of WSN Density
57 The Communication Graph
58 Challenge Detection of salient events in scalar fields. Focus on changes to regions of high activity. Focus on topological changes
59
60
61
62
63 Components A basic transition leads to a partition of the spatial domain into different components: Positive components Negative components Transition region A basic transition A partition
64 Irrelevant components Components that are not adjacent to the transition region are irrelevant to the type of topological changes Hole Self-merge
65 Key Features Property of the transition region (Added / Removed) Properties of the C-components (Represented by a tree) C-component a vertex Adjacency an edge Background C-component root Signs of the C-components labels
66 Classification Basic transitions of the same type have the same properties Hole Self-merge Properties of the C-components Type of Transition region: removed
67 Classification Different types of basic transitions have different properties
68 Acknowledgements NSF Project IIS : Monitoring Dynamic Spatial Fields Using Responsive Geosensor Networks John Stell Jixiang Jiang Cheng Zhong Chris Farah Lisa Walton Danqing Zhao
HW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 3.5: Deduce the k = 2 case of Menger s theorem (3.3.1) from Proposition 3.1.1. Let G be 2-connected, and let A and B be 2-sets. We handle some special cases (thus later in the induction if these
More informationREVIEW QUESTIONS. Chapter 1: Foundations: Sets, Logic, and Algorithms
REVIEW QUESTIONS Chapter 1: Foundations: Sets, Logic, and Algorithms 1. Why can t a Venn diagram be used to prove a statement about sets? 2. Suppose S is a set with n elements. Explain why the power set
More informationSimilarities and differences between outdoor and indoor space from the perspective of navigation
Similarities and differences between outdoor and indoor space from the perspective of navigation (Extended Abstract) Liping Yang, Michael Worboys Department of Spatial Information Science and Engineering,
More informationMath 440 Project Assignment
Math 440 Project Assignment 1. Overview The goal of your project assignment is to explore an aspect of topology beyond the topics covered in class. It will be necessary to use the tools and properties
More information1 Spaces and operations Continuity and metric spaces Topological spaces Compactness... 3
Compact course notes Topology I Fall 2011 Professor: A. Penskoi transcribed by: J. Lazovskis Independent University of Moscow December 23, 2011 Contents 1 Spaces and operations 2 1.1 Continuity and metric
More informationProcesses in Space. Luca Cardelli Microsoft Research. with Philippa Gardner Imperial College London
Processes in Space Luca Cardelli Microsoft Research with Philippa Gardner Imperial College London 2010-07-02 CiE Ponta Delgada http://lucacardelli.name Introduction Luca Cardelli 2010-07-02 2 From Topology
More informationRewriting Absolute Value Functions as Piece-wise Defined Functions
Rewriting Absolute Value Functions as Piece-wise Defined Functions Consider the absolute value function f ( x) = 2x+ 4-3. Sketch the graph of f(x) using the strategies learned in Algebra II finding the
More informationEach is equal to CP 1 minus one point, which is the origin of the other: (C =) U 1 = CP 1 the line λ (1, 0) U 0
Algebraic Curves/Fall 2015 Aaron Bertram 1. Introduction. What is a complex curve? (Geometry) It s a Riemann surface, that is, a compact oriented twodimensional real manifold Σ with a complex structure.
More informationModel Checking for Propositions CS477 Formal Software Dev Methods
S477 Formal Software Dev Methods Elsa L Gunter 2112 S, UIU egunter@illinois.edu http://courses.engr.illinois.edu/cs477 Slides based in part on previous lectures by Mahesh Vishwanathan, and by Gul gha January
More informationEilenberg-Steenrod properties. (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, )
II.3 : Eilenberg-Steenrod properties (Hatcher, 2.1, 2.3, 3.1; Conlon, 2.6, 8.1, 8.3 8.5 Definition. Let U be an open subset of R n for some n. The de Rham cohomology groups (U are the cohomology groups
More informationThe Fundamental Group
The Fundamental Group Renzo s math 472 This worksheet is designed to accompany our lectures on the fundamental group, collecting relevant definitions and main ideas. 1 Homotopy Intuition: Homotopy formalizes
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationProject: Construction of the Fundamental Group
Project: Construction of the Fundamental Group Renzo s math 472 This worksheet is designed to lead you to define and discover our first functor: the fundamental group. 1 Definitions First of all, let us
More informationShow that the following problems are NP-complete
Show that the following problems are NP-complete April 7, 2018 Below is a list of 30 exercises in which you are asked to prove that some problem is NP-complete. The goal is to better understand the theory
More informationMunkres Chapter 9. The Fundamental Group
Munkres 51. Homotopy of Paths 1 Munkres Chapter 9. The Fundamental Group Note. These supplemental notes are based on James R. Munkres Topology, 2nd edition, Prentice Hall (2000). Note. We are interested
More informationINTRO TO LIMITS & CALCULUS MR. VELAZQUEZ AP CALCULUS
INTRO TO LIMITS & CALCULUS MR. VELAZQUEZ AP CALCULUS WHAT IS CALCULUS? Simply put, Calculus is the mathematics of change. Since all things change often and in many ways, we can expect to understand a wide
More informationMATH 215B HOMEWORK 5 SOLUTIONS
MATH 25B HOMEWORK 5 SOLUTIONS. ( marks) Show that the quotient map S S S 2 collapsing the subspace S S to a point is not nullhomotopic by showing that it induces an isomorphism on H 2. On the other hand,
More informationHairy balls and ham sandwiches
Hairy balls and ham sandwiches Graduate Student Seminar, Carnegie Mellon University Thursday 14 th November 2013 Clive Newstead Abstract Point-set topology studies spaces up to homeomorphism. For many
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationCorrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015
Corrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015 Changes or additions made in the past twelve months are dated. Page 29, statement of Lemma 2.11: The
More informationQuiz-1 Algebraic Topology. 1. Show that for odd n, the antipodal map and the identity map from S n to S n are homotopic.
Quiz-1 Algebraic Topology 1. Show that for odd n, the antipodal map and the identity map from S n to S n are homotopic. 2. Let X be an Euclidean Neighbourhood Retract space and A a closed subspace of X
More informationInstitute of Operating Systems and Computer Networks Algorithms Group. Network Algorithms. Tutorial 3: Shortest paths and other stuff
Institute of Operating Systems and Computer Networks Algorithms Group Network Algorithms Tutorial 3: Shortest paths and other stuff Christian Rieck Shortest paths: Dijkstra s algorithm 2 Dijkstra s algorithm
More informationApproaches to the Enumerative Theory of Meanders. Michael La Croix
Approaches to the Enumerative Theory of Meanders Michael La Croix September 29, 2003 Contents 1 Introduction 1 1.1 Definitions............................. 2 1.2 Enumerative Strategies......................
More informationAdvanced Combinatorial Optimization September 22, Lecture 4
8.48 Advanced Combinatorial Optimization September 22, 2009 Lecturer: Michel X. Goemans Lecture 4 Scribe: Yufei Zhao In this lecture, we discuss some results on edge coloring and also introduce the notion
More information3. Prove or disprove: If a space X is second countable, then every open covering of X contains a countable subcollection covering X.
Department of Mathematics and Statistics University of South Florida TOPOLOGY QUALIFYING EXAM January 24, 2015 Examiners: Dr. M. Elhamdadi, Dr. M. Saito Instructions: For Ph.D. level, complete at least
More informationA Graph Rewriting Semantics for the Polyadic π-calculus
A Graph Rewriting Semantics for the Polyadic π-calculus BARBARA KÖNIG Fakultät für Informatik, Technische Universität München Abstract We give a hypergraph rewriting semantics for the polyadic π-calculus,
More informationIf X is a compact space and K X is a closed subset, then K is
6. Compactness...compact sets play the same role in the theory of abstract sets as the notion of limit sets do in the theory of point sets. Maurice Frechet, 1906 Compactness is one of the most useful topological
More informationComputer Science 385 Analysis of Algorithms Siena College Spring Topic Notes: Limitations of Algorithms
Computer Science 385 Analysis of Algorithms Siena College Spring 2011 Topic Notes: Limitations of Algorithms We conclude with a discussion of the limitations of the power of algorithms. That is, what kinds
More informationFailure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications
Failure Diagnosis of Discrete Event Systems With Linear-Time Temporal Logic Specifications Shengbing Jiang and Ratnesh Kumar Abstract The paper studies failure diagnosis of discrete event systems with
More informationNP-Completeness Part II
NP-Completeness Part II Recap from Last Time NP-Hardness A language L is called NP-hard iff for every L' NP, we have L' P L. A language in L is called NP-complete iff L is NP-hard and L NP. The class NPC
More informationAlgorithms And Programming I. Lecture 5 Quicksort
Algorithms And Programming I Lecture 5 Quicksort Quick Sort Partition set into two using randomly chosen pivot 88 31 25 52 14 98 62 30 23 79 14 31 2530 23 52 88 62 98 79 Quick Sort 14 31 2530 23 52 88
More informationfy (X(g)) Y (f)x(g) gy (X(f)) Y (g)x(f)) = fx(y (g)) + gx(y (f)) fy (X(g)) gy (X(f))
1. Basic algebra of vector fields Let V be a finite dimensional vector space over R. Recall that V = {L : V R} is defined to be the set of all linear maps to R. V is isomorphic to V, but there is no canonical
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationIntroduction to Computational Complexity
Introduction to Computational Complexity Tandy Warnow October 30, 2018 CS 173, Introduction to Computational Complexity Tandy Warnow Overview Topics: Solving problems using oracles Proving the answer to
More informationCalculus. Central role in much of modern science Physics, especially kinematics and electrodynamics Economics, engineering, medicine, chemistry, etc.
Calculus Calculus - the study of change, as related to functions Formally co-developed around the 1660 s by Newton and Leibniz Two main branches - differential and integral Central role in much of modern
More informationFEL3330 Networked and Multi-Agent Control Systems. Lecture 11: Distributed Estimation
FEL3330, Lecture 11 1 June 8, 2011 FEL3330 Networked and Multi-Agent Control Systems Lecture 11: Distributed Estimation Distributed Estimation Distributed Localization where R X is the covariance of X.
More informationCS357: CTL Model Checking (two lectures worth) David Dill
CS357: CTL Model Checking (two lectures worth) David Dill 1 CTL CTL = Computation Tree Logic It is a propositional temporal logic temporal logic extended to properties of events over time. CTL is a branching
More informationFractals. R. J. Renka 11/14/2016. Department of Computer Science & Engineering University of North Texas. R. J. Renka Fractals
Fractals R. J. Renka Department of Computer Science & Engineering University of North Texas 11/14/2016 Introduction In graphics, fractals are used to produce natural scenes with irregular shapes, such
More informationCIS (More Propositional Calculus - 6 points)
1 CIS6333 Homework 1 (due Friday, February 1) 1. (Propositional Calculus - 10 points) --------------------------------------- Let P, Q, R range over state predicates of some program. Prove or disprove
More informationAN INTRODUCTION TO THE FUNDAMENTAL GROUP
AN INTRODUCTION TO THE FUNDAMENTAL GROUP DAVID RAN Abstract. This paper seeks to introduce the reader to the fundamental group and then show some of its immediate applications by calculating the fundamental
More informationCS 512, Spring 2017, Handout 10 Propositional Logic: Conjunctive Normal Forms, Disjunctive Normal Forms, Horn Formulas, and other special forms
CS 512, Spring 2017, Handout 10 Propositional Logic: Conjunctive Normal Forms, Disjunctive Normal Forms, Horn Formulas, and other special forms Assaf Kfoury 5 February 2017 Assaf Kfoury, CS 512, Spring
More informationMath 6510 Homework 11
2.2 Problems 40 Problem. From the long exact sequence of homology groups associted to the short exact sequence of chain complexes n 0 C i (X) C i (X) C i (X; Z n ) 0, deduce immediately that there are
More informationModel Theory in the Univalent Foundations
Model Theory in the Univalent Foundations Dimitris Tsementzis January 11, 2017 1 Introduction 2 Homotopy Types and -Groupoids 3 FOL = 4 Prospects Section 1 Introduction Old and new Foundations (A) (B)
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More information(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2
Question 1 (a) Suppose A is the set of distinct letters in the word elephant, B is the set of distinct letters in the word sycophant, C is the set of distinct letters in the word fantastic, and D is the
More informationTemporal & Modal Logic. Acronyms. Contents. Temporal Logic Overview Classification PLTL Syntax Semantics Identities. Concurrency Model Checking
Temporal & Modal Logic E. Allen Emerson Presenter: Aly Farahat 2/12/2009 CS5090 1 Acronyms TL: Temporal Logic BTL: Branching-time Logic LTL: Linear-Time Logic CTL: Computation Tree Logic PLTL: Propositional
More informationHandlebody Decomposition of a Manifold
Handlebody Decomposition of a Manifold Mahuya Datta Statistics and Mathematics Unit Indian Statistical Institute, Kolkata mahuya@isical.ac.in January 12, 2012 contents Introduction What is a handlebody
More informationRigidity of Graphs and Frameworks
School of Mathematical Sciences Queen Mary, University of London England DIMACS, 26-29 July, 2016 Bar-and-Joint Frameworks A d-dimensional bar-and-joint framework is a pair (G, p), where G = (V, E) is
More informationLet X be a topological space. We want it to look locally like C. So we make the following definition.
February 17, 2010 1 Riemann surfaces 1.1 Definitions and examples Let X be a topological space. We want it to look locally like C. So we make the following definition. Definition 1. A complex chart on
More informationCSC 8301 Design & Analysis of Algorithms: Lower Bounds
CSC 8301 Design & Analysis of Algorithms: Lower Bounds Professor Henry Carter Fall 2016 Recap Iterative improvement algorithms take a feasible solution and iteratively improve it until optimized Simplex
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More information7.3 Singular Homology Groups
184 CHAPTER 7. HOMOLOGY THEORY 7.3 Singular Homology Groups 7.3.1 Cycles, Boundaries and Homology Groups We can define the singular p-chains with coefficients in a field K. Furthermore, we can define the
More informationRealization Plans for Extensive Form Games without Perfect Recall
Realization Plans for Extensive Form Games without Perfect Recall Richard E. Stearns Department of Computer Science University at Albany - SUNY Albany, NY 12222 April 13, 2015 Abstract Given a game in
More information1 Non-deterministic Turing Machine
1 Non-deterministic Turing Machine A nondeterministic Turing machine is a generalization of the standard TM for which every configuration may yield none, or one or more than one next configurations. In
More informationModel Checking with CTL. Presented by Jason Simas
Model Checking with CTL Presented by Jason Simas Model Checking with CTL Based Upon: Logic in Computer Science. Huth and Ryan. 2000. (148-215) Model Checking. Clarke, Grumberg and Peled. 1999. (1-26) Content
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationNP-Completeness Part II
NP-Completeness Part II Please evaluate this course on Axess. Your comments really do make a difference. Announcements Problem Set 8 due tomorrow at 12:50PM sharp with one late day. Problem Set 9 out,
More informationAC64/AT64/ AC115/AT115 DESIGN & ANALYSIS OF ALGORITHMS
Q.2 a. Solve the recurrence relation: T (n)=2t(n/2) + n; T(1) = 0 (6) Refer Complexity analysis of merge soft. b. Write the psuedocode for the Selection sort algorithm. What loop variant does it maintain?
More informationarxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
More informationRiemann surfaces. Paul Hacking and Giancarlo Urzua 1/28/10
Riemann surfaces Paul Hacking and Giancarlo Urzua 1/28/10 A Riemann surface (or smooth complex curve) is a complex manifold of dimension one. We will restrict to compact Riemann surfaces. It is a theorem
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationReduced Ordered Binary Decision Diagrams
Reduced Ordered Binary Decision Diagrams Lecture #12 of Advanced Model Checking Joost-Pieter Katoen Lehrstuhl 2: Software Modeling & Verification E-mail: katoen@cs.rwth-aachen.de December 13, 2016 c JPK
More informationTopological Logics over Euclidean Spaces
Topological Logics over Euclidean Spaces Roman Kontchakov Department of Computer Science and Inf Systems, Birkbeck College, London http://wwwdcsbbkacuk/~roman joint work with Ian Pratt-Hartmann and Michael
More informationFrom Liveness to Promptness
From Liveness to Promptness Orna Kupferman Hebrew University Nir Piterman EPFL Moshe Y. Vardi Rice University Abstract Liveness temporal properties state that something good eventually happens, e.g., every
More information30 Surfaces and nondegenerate symmetric bilinear forms
80 CHAPTER 3. COHOMOLOGY AND DUALITY This calculation is useful! Corollary 29.4. Let p, q > 0. Any map S p+q S p S q induces the zero map in H p+q ( ). Proof. Let f : S p+q S p S q be such a map. It induces
More informationA PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS
#A INTEGERS 9 (9), 7-37 A PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS Shu-Juan Duan School of Math. and Computational Sciences, Xiangtan University, Hunan, China jjmmcn@6.com
More informationComputation Tree Logic (CTL) & Basic Model Checking Algorithms
Computation Tree Logic (CTL) & Basic Model Checking Algorithms Martin Fränzle Carl von Ossietzky Universität Dpt. of Computing Science Res. Grp. Hybride Systeme Oldenburg, Germany 02917: CTL & Model Checking
More informationTopological K-theory
Topological K-theory Robert Hines December 15, 2016 The idea of topological K-theory is that spaces can be distinguished by the vector bundles they support. Below we present the basic ideas and definitions
More informationAlgorithms: COMP3121/3821/9101/9801
NEW SOUTH WALES Algorithms: COMP3121/3821/9101/9801 Aleks Ignjatović School of Computer Science and Engineering University of New South Wales LECTURE 9: INTRACTABILITY COMP3121/3821/9101/9801 1 / 29 Feasibility
More informationDescription Logics. Deduction in Propositional Logic. franconi. Enrico Franconi
(1/20) Description Logics Deduction in Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/20) Decision
More informationKnowledge-based systems
CS 750 Foundations of I Lecture 6 Knowledge-based systems Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square dministration announcements Midterm: Thursda October 6, 07 In-class Closed book What does
More information10 Excision and applications
22 CHAPTER 1. SINGULAR HOMOLOGY be a map of short exact sequences of chain complexes. If two of the three maps induced in homology by f, g, and h are isomorphisms, then so is the third. Here s an application.
More informationComputational Complexity of Bayesian Networks
Computational Complexity of Bayesian Networks UAI, 2015 Complexity theory Many computations on Bayesian networks are NP-hard Meaning (no more, no less) that we cannot hope for poly time algorithms that
More informationDecision Trees. Machine Learning CSEP546 Carlos Guestrin University of Washington. February 3, 2014
Decision Trees Machine Learning CSEP546 Carlos Guestrin University of Washington February 3, 2014 17 Linear separability n A dataset is linearly separable iff there exists a separating hyperplane: Exists
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationSummary of Prof. Yau s lecture, Monday, April 2 [with additional references and remarks] (for people who missed the lecture)
Building Geometric Structures: Summary of Prof. Yau s lecture, Monday, April 2 [with additional references and remarks] (for people who missed the lecture) A geometric structure on a manifold is a cover
More informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationBoolean decision diagrams and SAT-based representations
Boolean decision diagrams and SAT-based representations 4th July 200 So far we have seen Kripke Structures 2 Temporal logics (and their semantics over Kripke structures) 3 Model checking of these structures
More informationNATIONAL UNIVERSITY OF SINGAPORE CS3230 DESIGN AND ANALYSIS OF ALGORITHMS SEMESTER II: Time Allowed 2 Hours
NATIONAL UNIVERSITY OF SINGAPORE CS3230 DESIGN AND ANALYSIS OF ALGORITHMS SEMESTER II: 2017 2018 Time Allowed 2 Hours INSTRUCTIONS TO STUDENTS 1. This assessment consists of Eight (8) questions and comprises
More informationThe notion of space in mathematics. Matilde Marcolli
The notion of space in mathematics Matilde Marcolli general audience lecture at Revolution Books Berkeley 2009 Space is always decorated with adjectives (like numbers: integer, rational, real, complex)
More informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
More informationTHE JORDAN-BROUWER SEPARATION THEOREM
THE JORDAN-BROUWER SEPARATION THEOREM WOLFGANG SCHMALTZ Abstract. The Classical Jordan Curve Theorem says that every simple closed curve in R 2 divides the plane into two pieces, an inside and an outside
More informationTHE FUNDAMENTAL GROUP AND CW COMPLEXES
THE FUNDAMENTAL GROUP AND CW COMPLEXES JAE HYUNG SIM Abstract. This paper is a quick introduction to some basic concepts in Algebraic Topology. We start by defining homotopy and delving into the Fundamental
More informationWild coverings of Berkovich curves. Conference in honor of Arthur Ogus
Wild coverings of Berkovich curves M. Temkin September 24, 2015 Conference in honor of Arthur Ogus M. Temkin (Hebrew University) Wild coverings of Berkovich curves 1 / 27 Introduction The goals Fix a complete
More informationCALCULATION OF FUNDAMENTAL GROUPS OF SPACES
CALCULATION OF FUNDAMENTAL GROUPS OF SPACES PETER ROBICHEAUX Abstract. We develop theory, particularly that of covering spaces and the van Kampen Theorem, in order to calculate the fundamental groups of
More informationUSA Mathematical Talent Search Round 2 Solutions Year 27 Academic Year
1/2/27. In the grid to the right, the shortest path through unit squares between the pair of 2 s has length 2. Fill in some of the unit squares in the grid so that (i) exactly half of the squares in each
More information1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves?
1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves? This is most easily done by Prüfer codes. The number of times a vertex appears is the degree of the vertex.
More informationSet-Theoretic Geometry
Set-Theoretic Geometry Outline of Talk 1. The Filippov space under CH 2. Its demise under PFA and its survival under MA 3. Smooth arcs in the plane 4. Some questions All spaces are T 3 (Hausdorff and regular);
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationIROS 2009 Tutorial: Filtering and Planning in I-Spaces PART 3: VIRTUAL SENSORS
IROS 2009 Tutorial: Filtering and Planning in I-Spaces PART 3: VIRTUAL SENSORS Steven M. LaValle October 20, 2009 IROS 2009 Tutorial 1 / 94 IROS 2009 Tutorial 2 / 94 Physical Sensors vs. Virtual Sensors
More informationCS 583: Algorithms. NP Completeness Ch 34. Intractability
CS 583: Algorithms NP Completeness Ch 34 Intractability Some problems are intractable: as they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard working
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationSpatio-Temporal Stream Reasoning with Incomplete Spatial Information
Spatio-Temporal Stream Reasoning with Incomplete Spatial Information Fredrik Heintz and Daniel de Leng IDA, Linköping University, Sweden Abstract. Reasoning about time and space is essential for many applications,
More information1 Hochschild Cohomology and A : Jeff Hicks
1 Hochschild Cohomology and A : Jeff Hicks Here s the general strategy of what we would like to do. ˆ From the previous two talks, we have some hope of understanding the triangulated envelope of the Fukaya
More informationTopology of the set of singularities of a solution of the Hamilton-Jacobi Equation
Topology of the set of singularities of a solution of the Hamilton-Jacobi Equation Albert Fathi IAS Princeton March 15, 2016 In this lecture, a singularity for a locally Lipschitz real valued function
More informationComplexity Issues in Automated Addition of Time-Bounded Liveness Properties 1
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties 1 Borzoo Bonakdarpour and Sandeep S. Kulkarni Software Engineering and Network Systems Laboratory, Department of Computer Science
More informationand Other Combinatorial Reciprocity Instances
and Other Combinatorial Reciprocity Instances Matthias Beck San Francisco State University math.sfsu.edu/beck [Courtney Gibbons] Act 1: Binomial Coefficients Not everything that can be counted counts,
More information