1 The Contravariancy of Anticipatory Systems Dimitrios Sisiaridis, Michael Heather & Nick Rossiter Northumbria University, Newcastle NE2 1XE, UK Symposium.

Slides:



Advertisements
Similar presentations
Three-Step Database Design
Advertisements

I-ESA'08 Berlin1 Logical Foundations for the Infrastructure of the Information Market Heather, Michael, Livingstone, David, & Rossiter, Nick, CEIS, Northumbria.
Four-level Architecture for Closure in Interoperability EFIS, 17th-18th July 2003 Nick Rossiter & Michael Heather Informatics, Northumbria University
Adjoint Typing: Is it Whitehead’s Category of the Ultimate?
Database Systems: Design, Implementation, and Management Tenth Edition
1 What are Bit Strings? The View from Process Nick Rossiter Northumbria University.
Presented by: Thabet Kacem Spring Outline Contributions Introduction Proposed Approach Related Work Reconception of ADLs XTEAM Tool Chain Discussion.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model.
Slides adapted from A. Silberschatz et al. Database System Concepts, 5th Ed. Entity-Relationship Model Database Management Systems I Alex Coman, Winter.
1 Category Theory in a ( E,M ) -category Some aspects of category theory, in particular related to universality, can be developed in any finitely complete.
The Relationship between Topology and Logic Dr Christopher Townsend (Open University)
Data Modeling Using the Entity-Relationship Model
From Classical to Quantum Databases with Applied Pullbacks Nick Rossiter Seminar – PSSL, 15th February 2003
CSE314 Database Systems Data Modeling Using the Entity- Relationship (ER) Model Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson Ed Slide Set.
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
Anticipation in constructing and interrogating Natural Information Systems: From Classical through Nano to Quantum Computing.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model.
9/10/2012ISC 329 Isabelle Bichindaritz1 Entity Relationship (E-R) Modeling.
The Challenge of Interoperability: the Grid, Semantic Web and Categories Nick Rossiter Seminar -- Northumbria University, 13th November 2002
Assessing the Suitability of UML for Modeling Software Architectures Nenad Medvidovic Computer Science Department University of Southern California Los.
Copyright 2002 Prentice-Hall, Inc. Modern Systems Analysis and Design Third Edition Jeffrey A. Hoffer Joey F. George Joseph S. Valacich Chapter 20 Object-Oriented.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
Symposium 2: Applied Mathematics, Dynamical Systems, Logics and Category Theory CASYS’11 - International Conference on COMPUTING ANTICIPATORY SYSTEMS HEC.
Categories and Computer Science
 FOAL 2010 Modeling Aspects by Category Theory Serge P. Kovalyov Novosibirsk, Russia.
A Holistic Security Architecture for Distributed Information Systems – A Categorical Approach.
Anticipation as Prediction in the Predication of Data Types Michael Heather and Nick Rossiter CEIS, Northumbria University, Newcastle NE1 8ST
The Static Analysis Model Class Diagrams Prof. Hany H. Ammar, CSEE, WVU, and Dept. of Computer Science, Faculty of Computers and Information, Cairo University.
21st May 2004Informatics Research Conference, Northumbria University 1 Some Fundamental Questions in Databases Nick Rossiter (with Michael Heather)
The Representation of Reality in Computational Form Nick Rossiter Visiting Fellow with Michael Heather and Dimitrios Sisiaridis Computing, Engineering.
Lecture 2: Introduction to Category Theory Nick Rossiter, Computing Science, Newcastle University, England
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model.
Databases Illuminated Chapter 3 The Entity Relationship Model.
1 Generic Image Structures in Integrated Media Nick Rossiter & Michael Heather, University of Northumbria at Newcastle
CSE314 Database Systems Lecture 3 The Relational Data Model and Relational Database Constraints Doç. Dr. Mehmet Göktürk src: Elmasri & Navanthe 6E Pearson.
1 Typing in Information Systems Nick Rossiter, Michael Heather Computer Science and Digital Technologies Northumbria University, Newcastle NE1 8ST, UK.
1 Database Systems Entity Relationship (E-R) Modeling.
Lecture 4: Handling Heterogeneity with Information Resource Dictionary Systems Nick Rossiter, Computing Science, Newcastle University, England
The ODMG Standard for Object Databases
AREIN, I-ESA March Higher Order Logic and Interoperability in Global Enterprise Heather, Michael, Livingstone, David, & Rossiter, Nick, CEIS, Northumbria.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 7 Data Modeling Using the Entity- Relationship (ER) Model.
Fundamentals, Design, and Implementation, 9/e Appendix B The Semantic Object Model.
Free and Open Systems Theory Nick Rossiter Michael Heather University of Northumbria
Information Systems and the Theory of Categories: Is Every Model an Anticipatory System?
Lecture 3: Object Concepts as Categories Nick Rossiter, Computing Science, Newcastle University, England
ITEC0724 Modern Related Technology on Mobile Devices Lecture Notes #2 1.
The Natural Metaphysics of Computing Anticipatory Systems Michael Heather Nick Rossiter University of Northumbria
Presented by Kyumars Sheykh Esmaili Description Logics for Data Bases (DLHB,Chapter 16) Semantic Web Seminar.
1 Software Requirements Descriptions and specifications of a system.
© Copyright 2008 STI INNSBRUCK Formal Concept Analysis Intelligent Systems – Lecture 12.
WOSC 2008 Wroclaw1 Problems of Interoperability in Information Systems Nick Rossiter and Michael Heather CEIS, Northumbria University, UK
Data Modeling Using the Entity- Relationship (ER) Model
COP Introduction to Database Structures
Entity- Relationship (ER) Model
Conceptual Design & ERD Modelling
Business System Development
Requirements Become the E-R Data Model
SysML v2 Formalism: Requirements & Benefits
Chapter 7: Entity-Relationship Model
Databases and Database Management Systems Chapter 9
Chapter 2 Sets and Functions.
A Universal Technique for Relating Heterogeneous Data Models
Outline of the ER Model By S.Saha
Entity-Relationship Modeling
A Natural Basis for Interoperability
Manager’s Overview DoDAF 2.0 Meta Model (DM2) TBS dd mon 2009
Categories for Information
Conditions for Interoperability
The Process Semantics of Time and Space as Anticipation
Process in the World as a Transaction
Presentation transcript:

1 The Contravariancy of Anticipatory Systems Dimitrios Sisiaridis, Michael Heather & Nick Rossiter Northumbria University, Newcastle NE2 1XE, UK Symposium 10: 8th BCSCMsG International Symposium on Computational Self-Organised Emergence CASYS’11 - International Conference on COMPUTING ANTICIPATORY SYSTEMS HEC Management School University of Liege, LIEGE, Belgium, August 8-13, 2011

2 Nature of Anticipation Where does anticipation come from? By definition strong anticipation resides in the anticipatory system itself. If this is so, anticipation is of the nature of the system and forms part of the Universe. Anticipation must therefore reside in nature and arise from relationships in nature. Likewise from no more than its definition, the Universe consists of entities related one to the other. Thus each entity affects every other.

3 Existence and Cartesian Closure Existence is not therefore just a first order effect but needs an inherent higher order formalism to represent such multi-body interdependence. The relationship between any pair of entities depends on every possible path between them. In category theory this is the property of cartesian closure found in the highest structure possible -- the identity natural transformation designated as the ‘topos’. However if every entity is related to every other it follows that the relationship is both ways but not just a simple inverse relationship as appears from the laws of physics.

4 Duality ● A category C of objects and arrows between the objects will have a dual C op with arrows reversed. ● The whole universal structure of both-ways relationships will then be represented by the product C op x C. ● This gives rise to the principle of duality throughout the Universe.

5 Ubiquity of Duality ● Duality is a common enough concept in mathematics, philosophy and most of the sciences with some renowned examples like the mind-body duality. - It also appears in other versions of contrast as between the dynamic and the static and between global and local. ● To capture the full effect and subtleties of opposing views and relationships a single view of the duality is needed as a process.

6 Duality and Variance ● Duality is not a closed Boolean view. - Rather it encapsulates opposite orderings within a single (functorial) concept of variancy. - These may be conveniently labelled covariant and contravariant but only relative one to the other and not as absolute descriptions. ● Systems theory is a case in point where these different views need to be integrated. - Thus for anticipatory systems, anticipation is an instantaneous, local static instantiation of a dynamic global feature that looks either forward or back. ●The natural categories of process as advanced by Whitehead encompass this contravariancy found in reality.

7 Covariant and Contravariant Functors Opposite Covariant F Contravariant F-bar

8 Contravariancy Highlighted by Lawvere in 1969 as basic property in the intension-extension relationship Governing data values in the context of their name and type Basic property of universe Lawvere defined the relationship between intension and extension in terms of adjoint functors with contravariant mapping – Used concept of hyperdoctrine – Some 'translation' needed for applied scene

9 Why Contravariant? The extension is of the form: value → nameN:1 The intension is of the form: name → typeN:1 If these arrows were reversed, they would not be functions so can reject such forms: name → value 1:N type → name 1:N

10 Turn around one arrow But the common attribute in extension and intension – name – is codomain in extension and domain in intension. So cannot do simple covariant mapping of one to the other. Need to turn around the arrow in the intension name → typetype → name And map this onto value → name in extension So that value is related to type in the context of a common name

11 Ultimate Contravariancy A three-level structure is sufficient to provide complete closure with internal contravariant logic providing a generalisation of negation. – Further levels are redundant Contravariancy across levels provides more sophisticated reversals such as reverse engineering. The ultimate contravariancy is to be found in the universal adjointness - between any pair of functors contravariant one to the other - to provide both the quantitative and qualitative semantics of intension-extension logic.

12 Worked Example of Three-level Architecture Choices for realisation in formal terms Informal look at structures and relationships Outline in informal categories Two-way mappings as adjunctions Examples of Contravariancy

13 MetaMeta Policy Meta Organize Classify Instantiate Concepts Constructs Schema Types Named Data Values Downward arrows are intension-extension pairs Figure 1: Informal requirements for Information System Architecture

14 Formalising the Architecture Requirements: –mappings within levels and across levels –bidirectional mappings –closure at top level –open-ended logic –relationships (product and coproduct) Choice: Category theory as used in mathematics as a workspace for relating different constructions

15 Figure 2: Interpretation of Levels as Natural Schema in General Terms blue – category, red - functor, green - natural transformation

16 Figure 3: Example for Comparison of Mappings in two Systems Categories: CPT concepts, CST constructs, SCH schema, DAT data, Functors: P policy, O org, I instance, Natural transformations: , ,  (Organisational interoperability)

17 black - objects Figure 4: Defining the Three Levels with Contravariant Functors and Intension-Extension (I-E) Pairs

18 Figure 5: Examples of Levels in the Three Level Architecture Cross-over arrows indicate contravariant mapping

19 Figure 6: Composition of Adjoints is Natural If functors are adjoint, there is a unique relationship between them (a natural bijection).

20 Further Work needed on Three-level Architecture Lack of detail on Adjoint relationships Underlying categories How are they defined?

21 Unit and Counit of Adjunction between levels DAT and SCH F --| G η value : value → GF(value) ε type : FG(type) → type F --| G η value : value → G(name) ε type : FG(name) → type F --| G η value : value' → G(name') ε type : FG(name') → type'

22 Example Mapping derived from Relative Ordering of F --| G Can think of adjointness as a relative ordering. The contravariant mapping enables arrows g to type to be slotted onto the appropriate name. name and type are both preorders. Contravariant functors reverse the direction of composition.

23 Nature of Categories in Three-level Architecture Consider categories DAT and SCH. DAT holds values in the form: value → name But the basic structure must be more complex than this as also need to hold: Relationships between values Identifiers of data items

24 Suitable Constructions Cartesian closed for connectivity, product (universal relationship) and identifier. Locally cartesian closed to refine relationship from a general product to a specific context. Locally cartesian closed categories: Pullback Comma (two functors with same codomain, Lawvere) In theoretical computing much use of locally cartesian closed categories after work by Seely on type theory of Martin-Löf.

25 Adjoint Functors in a Pullback Diagram in level DAT VN T↓ S NAMES VALUES Q P T M S K T↓ S is comma category, relationship between T and S in context of VN; T is identity functor on VALUES in VN, S is selection functor on NAMES in VN; P, Q, E, N are projection functors; M is right adjoint to T; K is right adjoint to S; L is product functor VN is NAMES+VALUES VN ↓VN VxN VxN is NAMESxVALUES L E N VN dom VN cod VN dom, VN cod are forgetful functors

26 Generalisation of DAT Comma category T↓ S acts as a constraint limit on the product category E x D Product functor L and inclusion functor R compose a bifunctor (binary functor) T may be free functor S may be underlying functor D and E can be any level in four levels of categories involved in three-level architecture C is E+D

27 Further Work Investigate further the generalisation of DAT Look at applicability to dynamic application of three- level architecture Suggested application domain is security Explore further the details of DAT and SCH Conditions for isomorphism

28 Contravariance and Anticipation An anticipatory system is but the structured ordering of adjointness between the systems as a whole and every locality within it. - Thus in the special case of time, the present is the particular locality of interest as a reductionist self- duality. The past and the present is a contravariant view of the past from the present - while the present access to future states is also a contravariant arrow from the future to the present.