Managing ontology versions with a distributed blackboard architecture Ernesto Compatangelo, Wamberto Vasconcelos and Bruce Scharlau.

Slides:



Advertisements
Similar presentations
Dr. Leo Obrst MITRE Information Semantics Information Discovery & Understanding Command & Control Center February 6, 2014February 6, 2014February 6, 2014.
Advertisements

The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
Bboogle Teams: Supporting Small Group Communications through Google Apps Integration with the Blackboard Learn Platform Jonathan Smith, Software Architect,
Copyright Hub Software Engineering Ltd 2010All rights reserved Hub Document Exchange Product Overview Secure Transmission for Transaction-based Documents.
JTX Overview Overview of Job Tracking for ArcGIS (JTX)
JavaSpaces and TSpaces Theresa Tamash CDA 5937 November 4, 2002.
PZ13B Programming Language design and Implementation -4th Edition Copyright©Prentice Hall, PZ13B - Client server computing Programming Language.
Software Engineering COMP 201
©Ian Sommerville 2006Software Engineering, 8th edition. Chapter 8 Slide 1 System models.
Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 8 Slide 1 System models.
Chapter 9: Moving to Design
Distributed Collaborations Using Network Mobile Agents Anand Tripathi, Tanvir Ahmed, Vineet Kakani and Shremattie Jaman Department of computer science.
Chapter 10: Architectural Design
Architectural Design Establishing the overall structure of a software system Objectives To introduce architectural design and to discuss its importance.
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 11 Slide 1 Architectural Design.
GMD German National Research Center for Information Technology Innovation through Research Jörg M. Haake Applying Collaborative Open Hypermedia.
Database Systems: Design, Implementation, and Management Ninth Edition
Chapter 1 Database Systems. Good decisions require good information derived from raw facts Data is managed most efficiently when stored in a database.
Chapter 10 Architectural Design
CONTI’2008, 5-6 June 2008, TIMISOARA 1 Towards a digital content management system Gheorghe Sebestyen-Pal, Tünde Bálint, Bogdan Moscaliuc, Agnes Sebestyen-Pal.
The Design Discipline.
Cardea Requirements, Authorization Model, Standards and Approach Globus World Security Workshop January 23, 2004 Rebekah Lepro Metz
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 7 Slide 1 System models l Abstract descriptions of systems whose requirements are being.
Chapter 4 System Models A description of the various models that can be used to specify software systems.
Database Design – Lecture 16
AL-MAAREFA COLLEGE FOR SCIENCE AND TECHNOLOGY INFO 232: DATABASE SYSTEMS CHAPTER 1 DATABASE SYSTEMS (Cont’d) Instructor Ms. Arwa Binsaleh.
Team Skill 6: Building the Right System From Use Cases to Implementation (25)
1st Workshop on Intelligent and Knowledge oriented Technologies Universal Semantic Knowledge Middleware Marek Paralič,
Using the Open Metadata Registry (openMDR) to create Data Sharing Interfaces October 14 th, 2010 David Ervin & Rakesh Dhaval, Center for IT Innovations.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 10Slide 1 Architectural Design l Establishing the overall structure of a software system.
Architecture styles Pipes and filters Object-oriented design Implicit invocation Layering Repositories.
Distributed Processing and Client/Server
Chapter 10 Information Systems Analysis and Design
Session-8 Data Management for Decision Support
Information System Development Courses Figure: ISD Course Structure.
OOI CI LCA REVIEW August 2010 Ocean Observatories Initiative OOI Cyberinfrastructure Architecture Overview Michael Meisinger Life Cycle Architecture Review.
Chapter 7 System models.
Architectural Design Yonsei University 2 nd Semester, 2014 Sanghyun Park.
Modified by Juan M. Gomez Software Engineering, 6th edition. Chapter 7 Slide 1 Chapter 7 System Models.
Sommerville 2004,Mejia-Alvarez 2009Software Engineering, 7th edition. Chapter 8 Slide 1 System models.
Performance evaluation of component-based software systems Seminar of Component Engineering course Rofideh hadighi 7 Jan 2010.
Distributed Systems Principles and Paradigms Chapter 12 Distributed Coordination-Based Systems 01 Introduction 02 Communication 03 Processes 04 Naming.
Recuperação de Informação B Cap. 10: User Interfaces and Visualization , , 10.9 November 29, 1999.
9 Systems Analysis and Design in a Changing World, Fourth Edition.
9 Systems Analysis and Design in a Changing World, Fourth Edition.
ANKITHA CHOWDARY GARAPATI
AL-MAAREFA COLLEGE FOR SCIENCE AND TECHNOLOGY INFO 232: DATABASE SYSTEMS CHAPTER 1 DATABASE SYSTEMS Instructor Ms. Arwa Binsaleh.
Cooperative experiments in VL-e: from scientific workflows to knowledge sharing Z.Zhao (1) V. Guevara( 1) A. Wibisono(1) A. Belloum(1) M. Bubak(1,2) B.
Jini Architecture Introduction System Overview An Example.
Department of Industrial Engineering Sharif University of Technology Session# 9.
1 Object Oriented Logic Programming as an Agent Building Infrastructure Oct 12, 2002 Copyright © 2002, Paul Tarau Paul Tarau University of North Texas.
Architecture View Models A model is a complete, simplified description of a system from a particular perspective or viewpoint. There is no single view.
Software Engineering1  Verification: The software should conform to its specification  Validation: The software should do what the user really requires.
Lecture VIII: Software Architecture
The overview How the open market works. Players and Bodies  The main players are –The component supplier  Document  Binary –The authorized supplier.
Database Systems: Design, Implementation, and Management Eighth Edition Chapter 1 Database Systems.
Application architectures Advisor : Dr. Moneer Al_Mekhlafi By : Ahmed AbdAllah Al_Homaidi.
1 © 2013 Cengage Learning. All Rights Reserved. This edition is intended for use outside of the U.S. only, with content that may be different from the.
A Semi-Automated Digital Preservation System based on Semantic Web Services Jane Hunter Sharmin Choudhury DSTC PTY LTD, Brisbane, Australia Slides by Ananta.
Database Principles: Fundamentals of Design, Implementation, and Management Chapter 1 The Database Approach.
Data Grids, Digital Libraries and Persistent Archives: An Integrated Approach to Publishing, Sharing and Archiving Data. Written By: R. Moore, A. Rajasekar,
WEB SERVICES From Chapter 19 of Distributed Systems Concepts and Design,4th Edition, By G. Coulouris, J. Dollimore and T. Kindberg Published by Addison.
Software Design and Architecture
Distribution and components
Web Ontology Language for Service (OWL-S)
Datamining : Refers to extracting or mining knowledge from large amounts of data Applications : Market Analysis Fraud Detection Customer Retention Production.
Chapter 2 Database Environment Pearson Education © 2009.
Distributed Systems through Web Services
WEB SERVICES From Chapter 19, Distributed Systems
Chapter 2 Database Environment Pearson Education © 2009.
Presentation transcript:

Managing ontology versions with a distributed blackboard architecture Ernesto Compatangelo, Wamberto Vasconcelos and Bruce Scharlau

AI 2004 Compatangelo, Vasconcelos and Scharlau Overview zVersioning Context zArchitecture zFramework zRepresentation zScenarios zConclusions and future work

AI 2004 Compatangelo, Vasconcelos and Scharlau Software versioning zConcurrent versioning system (CVS) and Subversion used for software engineering compare versions line-by-line zDoesnt work in ontologies where there are multiple ways to write the ontology zNeed something else…

AI 2004 Compatangelo, Vasconcelos and Scharlau Context of ontology versioning z Ontology versioning y supports the evolution of a conceptualisation y formally represents this evolution as a set of transformations between ontology versions y involves recording, analysing, deriving, classifying, and combining changes between ontology versions y often occurs in a distributed environment

AI 2004 Compatangelo, Vasconcelos and Scharlau Why ontology versioning? z Keeping track of ontology versions is useful to y evaluate the different context- dependent consequences of changes on the knowledge repositories and y query the knowledge-based applications that use the evolving ontology y ensure that the applications using the ontology are not broken by changes

AI 2004 Compatangelo, Vasconcelos and Scharlau What else? zNeed to keep track of more than ontology versioning information zAlso need… yProfiling team members xHow often and how much each member contributes xQuality of contributions yRecording responsibilities – who did what yRecording justification for changes

AI 2004 Compatangelo, Vasconcelos and Scharlau Architecture JavaSpace Reports Notification Other functions Other functions Changes Forminteraction Forminteraction Distillchanges Distillchanges Alternativeviews Alternativeviews Ontology Editors Ontology Editors Web Browsers Web Browsers Reasoning Tools Reasoning Tools Visualisation Tools Visualisation Tools Agent 1 Agent 2 Agent n …. Blackboard

AI 2004 Compatangelo, Vasconcelos and Scharlau ConcepTool Example Local Filespace Local Filespace

AI 2004 Compatangelo, Vasconcelos and Scharlau Framework: I-MOMS and OVM zInferential Multiple Ontology Management System (I-MOMS) yencompasses ontology elicitation, modelling, validation, interoperability, integration, and versioning in the semantic grid zOntology Versioning Manifold (OVM) yEvolutionary history documentation of each concept across different ontology versions yReconstruction of each concept in the ontology using the versioning information yEnable virtual versioning hierarchy with set of overlapping ontologies

AI 2004 Compatangelo, Vasconcelos and Scharlau Representation of changes zGiven an ontology we want to represent the changes at the end of the editing session that end in the variant ontology version [i,1] zResult of each operation f k must be a variant ontology [i,1] of [i] zAllow for the reconstruction of development history of the ontology from course-grain to fine-grain

AI 2004 Compatangelo, Vasconcelos and Scharlau Versioning Scenarios Rewriting rules yCreation of a concept yRenaming of a concept Addition of attribute/value pair to a concept zThe rewriting rules should accommodate means for user-interaction, allowing engineers to experiment with distinct combinations. A graph may be better represention as different sequences of operations may result in the same ontology.

AI 2004 Compatangelo, Vasconcelos and Scharlau Example - Various paths

AI 2004 Compatangelo, Vasconcelos and Scharlau Conclusions and the road ahead zOntology building demands tools that support distributed team work zOurs is a knowledge-rich approach to versioning deployed in an open, pluggable, lightweight and scalable architecture zThe justifications of design and changes allows for formal reasoning about the design activity

AI 2004 Compatangelo, Vasconcelos and Scharlau Thanks for your time. Any questions?

AI 2004 Compatangelo, Vasconcelos and Scharlau Related versioning work zThere are yFrameworks for versioning evolution yModelling and representing change details ySpecifying change operations and their implications yDeveloping algorithms and tools for comparing versions zTools to do each (and some) of these, but nothing to do all of these zNone of the others address the reasoning with and about the versioning space issue

AI 2004 Compatangelo, Vasconcelos and Scharlau Architecture Features zAgents ymonitor the space yprepare reports ysearch for components zOntology editors yperform changes in the versioning space and yadd extra knowledge on the operations carried out zWeb browsers yinteract with the shared space via forms zReasoners ydistill complex ontology changes from a log of yediting changes, including ystructural, and lexical differences between ontology versions zVisualisation tools zallow the inspection and retrieval of the shared space along different dimensions and in alternative formats

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: what are they? zJavaSpaces applications: collections of processes cooperating by exchanging objects using one or more spaces

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: what are they? zJava implementation of space-based distributed computing zImplementation consists of: ySpaces yPrimitive operations to allow processes to use spaces zWhat is a space? yShared, network-accessible repository for objects zWhat are the operations? yMeans to store & exchange objects in spaces zNo direct (point-to-point) communication

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: what are they? zProcesses perform simple operations to: yWrite objects onto space yTake (remove) objects from space yRead (copy) objects from space zWhen taking/reading objects, processes yUse a simple lookup to find objects yMay be blocked if no such object exists (if we want…) zIn order to modify an object, processes must yRemove object from space, yAlter it and then yReinsert it onto space

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: what are they? zSpace-based applications require yDistributed data structures and yDistributed protocols zDistributed data structures: yMultiple objects stored in different spaces yData structures held in a space can be concurrently accessed and modified by different processes zDistributed protocols: yDefine the way processes share and modify data structures in a coordinated way.

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: what are they? zDistributed protocols are loosely coupled: ySenders and receivers do not need to know each other ySenders and receivers do not need to be active simultaneously zUsing a shared space, we write an object with the expectation that ySomeone, Sometime, Somewhere Will take the object and use it according to the distributed protocol zDesigners/Programmers yDefine distribute protocol AND yEnsure that processes follow it

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: key features zSpaces are shared: yNetwork-accessible shared memories yMany remote processes can interact concurrently ySpace itself handles concurrent accesses zSpaces are persistent: yReliable storage for objects. yOnce stored in a space, an object will stay there until a process removes it. yProcesses may specify a time after which the object will be destroyed.

AI 2004 Compatangelo, Vasconcelos and Scharlau JavaSpaces: key features zSpaces are associative: yObjects are located via associative lookups yWe use a template to match against objects. A template is an object with some/all of its fields set to specific values or null (wildcard). zSpaces are transactionally secure: yAn operation on a space is an atomic affair zSpaces allow us to exchange executable content: yWhen a process gets an object from a space a local copy is created; yAs a local object, we can modify its public fields and invoke its methods; yWe can extend the behaviour of our applications

AI 2004 Compatangelo, Vasconcelos and Scharlau Architecture JavaSpace Reports Notification Other functions Other functions Changes Forminteraction Forminteraction Distillchanges Distillchanges Alternativeviews Alternativeviews