Cyber-Physical Graphs vs

Slides:

Advertisements

Similar presentations

Based on: Petri Nets and Industrial Applications: A Tutorial

Advertisements

Interne Groupe France Télécom ICN: Opportunities and Challenges Orange Labs – France Telecom Group Bruno Kauffmann, Orange Labs 18 May 2011, ICN Session,

Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.

UMBC an Honors University in Maryland 1 Uncertainty in Ontology Mapping: Uncertainty in Ontology Mapping: A Bayesian Perspective Yun Peng, Zhongli Ding,

Building and Analyzing Social Networks Web Data and Semantics in Social Network Applications Dr. Bhavani Thuraisingham February 15, 2013.

Visual Event Detection & Recognition Filiz Bunyak Ersoy, Ph.D. student Smart Engineering Systems Lab.

Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.

INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.

Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.

Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.

CS8803-NS Network Science Fall 2013

Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.

Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia Tech) ITER: A Computational Model to Evaluate Provider and Peer Selection in the Internet Ecosystem.

Distributed Computing Rik Sarkar. Distributed Computing Old style: Use a computer for computation.

1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.

Graph Theory & Networks Name:____________Date:______ Try to trace each figure below without lifting your pencil from the paper and without retracing any.

Artificial Intelligence Knowledge Representation.

Students: Anurag Anjaria, Charles Hansen, Jin Bai, Mai Kanchanabal Professors: Dr. Edward J. Delp, Dr. Yung-Hsiang Lu CAM 2 Continuous Analysis of Many.

Experiments Test different parking lot images captured in different luminance conditions The test samples include 1300 available parking spaces and 1500.

Characteristics of an efficient transportation system - a well designed intra-city system - reasonable cost - high degree of safety and reliability - avoid.

L – Modelling and Simulating Social Systems with MATLAB Lesson 6 – Graphs (Networks) Anders Johansson and Wenjian Yu (with S. Lozano.

SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.

ITS and Electric Vehicles What is the nexus How does the topic relate to STWG.

Confidential | RBEI / NBD | 27/08/2015 | © Robert Bosch Engineering and Business Solutions Private Limited All rights reserved, also regarding any.

November 25th, 2015 The Internet of Everything... Addressing the challenges of a changing world Yasser Helmy Business Development – Smart Cities, EMEA.

Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.

Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.

GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,

Real-time maps of charger availability * Battery duration of miles Integrated transport, e.g. EV hire from train station included with train.

Parallel and Perpendicular Lines

Students: Aiman Md Uslim, Jin Bai, Sam Yellin, Laolu Peters Professors: Dr. Yung-Hsiang Lu CAM 2 Continuous Analysis of Many CAMeras The Problem Currently.

Semantic Search - Potential and Opportunities. © 2014 SAPIENT CORPORATION | CONFIDENTIAL 2 Search – Where we were!

1 COMP541 Finite State Machines - 1 Montek Singh Sep 22, 2014.

Urban Traffic Simulated From A Dual Perspective Hu Mao-Bin University of Science and Technology of China Hefei, P.R. China

Anonymous communication over social networks Shishir Nagaraja and Ross Anderson Security Group Computer Laboratory.

A stop sign is a traffic sign that stands for coming to a complete stop at an intersection or end of the road.

NN k Networks for browsing and clustering image collections Daniel Heesch Communications and Signal Processing Group Electrical and Electronic Engineering.

Author: Akiyoshi Matonoy, Toshiyuki Amagasay, Masatoshi Yoshikawaz, Shunsuke Uemuray.

Recalibration Problem Virtual Sensors (VS’s) Detect Events E.g., Coffee Level Rescue Kitchen, West-East Traffic light Next to Calit(2). VS-Output Coffee.

Smart City A Public-Private Partnership. Uses communication networks, wireless sensor technology and intelligent data management to make decisions in.

1 COMP541 Sequential Logic – 2: Finite State Machines Montek Singh Feb 29, 2016.

Theory of Computation. Introduction to The Course Lectures: Room ( Sun. & Tue.: 8 am – 9:30 am) Instructor: Dr. Ayman Srour (Ph.D. in Computer Science).

Sensor Networks © M Jamshidi.

CLOUD ARCHITECTURE Many organizations and researchers have defined the architecture for cloud computing. Basically the whole system can be divided into.

Lecture 23: Structure of Networks

Fostering Innovation to Build a Smart City Culture

Project 2: Ultra Traffic Light Controller

Lecture 4. Sequential Logic #2

1.3 Finite State Machines.

Smart Meter Technology European Style!?

Randomized Algorithm (Lecture 2: Randomized Min_Cut)

فایل ارائه حاضر توسط مرکز تحقیقاتِ فناوری «اینترنتی از اشیاء» در ایران

COMP541 Sequential Logic – 2: Finite State Machines

ECEN 248 Lab 9: Design of a Traffic Light Controller

SETS & FUNCTIONS NOTATION & TERMINOLOGY

Driving the UK towards zero emissions

Lecture 23: Structure of Networks

Analyzing and Securing Social Networks

First simulation results

Smart Cities Uroš Merljak.

Lecture 19-Problem Solving 4 Incremental Method

Calibration and Validation

Lecture 23: Structure of Networks

From street lighting control to SmartCity

Graphs G = (V,E) V is the vertex set.

Chapter 9 Graph algorithms

Research Issues in Middleware (Bhaskar)

Sub 1 GHz Use Case Discussion

Presentation transcript:

Cyber-Physical Graphs vs Cyber-Physical Graphs vs. RDF graphs Gilles Privat Orange Labs, Grenoble, France

CPS Graphs Graphs that model (man-made) Cyber-Physical Systems Have been used long before the Web & RDF …. Have semantics of their own These (operational or structural) semantics apply to the graph as a whole, not to individual nodes or arcs yet complemtary to per-resource RDF style semantics CPS graphs should not be subsumed by RDF graphs Arcs (relationships) may need to have properties, without resorting to reification Proper structure of the graph should be maintained to run graph-theoretic algorithms (e.g. maximal flow) perform graph structure analysis (e.g. spectral analysis, degree distribution, etc.)

Examples of CPS graphs (1/2) with semantics that is not reducible to RDF-style (referential) semantics Finite-State Mealy Machine (state-transition graph, operational semantics Physical network (structural/topological semantics) Street network Electrical grid means means means

Examples of CPS graphs (2/2) « Systems of systems » structural description red Traffic-lights control System Graph hasState Traffic Light TL1 70% y% congested isNodeOf Graph Surveillance Camera A1 hasCoverage hasState actuatedBy Traffic management System Graph monitors Street A connectsTo Traffic Management System Crossing isNodeOf Graph isSub GraphOf Smart City System Graph open/ closed hasState connectsTo Empty/ Occupied isNodeOf Graph hasState Parking A Contains Parking management System Graph handicapped parking space AH1 hasState n/N available spaces Empty/ Occupied EV fast charger Parking Management System hasState Contains hasPower EV charging space AE1

CPS graph captured as NGSI-LD property graphs, with RDF/RDFS/OWL semantics as an overlay DUL:PhysicalObject DUL: InformationEntity NGSI-LD: graph SOSA:Actuator SOSA:Sensor Surveillance Camera A1 Parking A Street A hasState connectsTo monitors Parking Management System open/ closed y% congested n/N available spaces handicapped parking space AH1 Empty/ Occupied EV charging space AE1 Contains EV fast charger hasPower hasCoverage 70% Traffic Light TL1 actuatedBy Crossing red Traffic management System Graph Parking management System Graph Smart City System Graph isSub GraphOf Traffic-lights control System Graph isNodeOf Graph Traffic Management System